Suchergebnisse - "fully polynomial\-time approximation scheme"

Assortment optimization under the multinomial logit choice model with product-specific capacities

Autoren: Huh, Woonghee Tim Liu, Siyue

Quelle: Operations Research Letters. 59:107238

Schlagwörter: fully polynomial-time approximation scheme (FPTAS), assortment optimization, Operations research, mathematical programming, product-specific capacities

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/8036075
https://doi.org/10.1016/j.orl.2024.107238

Packing squares independently

Autoren: Wei Wu Hiroki Numaguchi Nir Halman et al.

Quelle: Theoretical Computer Science. 1024:114910

Schlagwörter: dynamic programming, Combinatorial optimization, strip packing, fully polynomial-time approximation scheme, Packing and covering in \(2\) dimensions (aspects of discrete geometry), complexity, Combinatorial aspects of packing and covering, Approximation algorithms

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/7957598
https://doi.org/10.1016/j.tcs.2024.114910

On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths

Autoren: Pavel A. Borisovsky Anton V. Eremeev Vadim Teplyakov et al.

Quelle: Yugoslav Journal of Operations Research, Vol 29, Iss 1, Pp 93-112 (2019)

Schlagwörter: T58.6-58.62, software defined satellite network, computational experiment, fully polynomial-time approximation scheme, 0211 other engineering and technologies, linear programming, Management information systems, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, greedy heuristic

Zugangs-URL: http://www.doiserbia.nb.rs/ft.aspx?id=0354-02431800034B
https://doaj.org/article/988de7f13dea4c62b46e753b32a587e1
http://www.doiserbia.nb.rs/ft.aspx?id=0354-02431800034B
http://doiserbia.nb.rs/Article.aspx?id=0354-02431800034B

Parallel-Batch Scheduling With Deterioration and Group Technology

Autoren: Cuixia Miao

Quelle: IEEE Access, Vol 7, Pp 119082-119086 (2019)

Schlagwörter: Parallel-batch scheduling, 0211 other engineering and technologies, group technology, Electrical engineering. Electronics. Nuclear engineering, 02 engineering and technology, deterioration, fully polynomial time approximation scheme, TK1-9971

Zugangs-URL: https://ieeexplore.ieee.org/ielx7/6287639/8600701/08805058.pdf
https://doaj.org/article/85f65522fbc942eb9848d4edeee8b92f
https://dblp.uni-trier.de/db/journals/access/access7.html#Miao19

Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing

Autoren: Caprara, Alberto Lodi, Andrea Monaci, Michele

Quelle: Mathematics of Operations Research, 2005 Feb 01. 30(1), 150-172.

Zugangs-URL: https://www.jstor.org/stable/25151644

An FPTAS for the parallel two-stage flowshop problem

Autoren: Dong, Jianming Tong, Weitian Luo, Taibo et al.

Quelle: Theoretical Computer Science. 657:64-72

Schlagwörter: Makespan, Computer Sciences, 4. Education, 8. Economic growth, 0211 other engineering and technologies, Two-stage flowshop scheduling, 0102 computer and information sciences, 02 engineering and technology, Dynamic programming, Fully polynomial-time approximation scheme, 01 natural sciences, Multiprocessor scheduling

An Approach to Web Services Selection for Multiple Users

Autoren: Wenlong Zhu Beibei Yin Siqian Gong et al.

Quelle: IEEE Access, Vol 5, Pp 15093-15104 (2017)

Schlagwörter: Advanced a-fully polynomial time approximation scheme, web service selection, 0202 electrical engineering, electronic engineering, information engineering, artificial bee colony algorithm, multiple users, Electrical engineering. Electronics. Nuclear engineering, 02 engineering and technology, Pareto optimal set, TK1-9971

Zugangs-URL: https://doaj.org/article/5d6cd9241b7d465f9250b7c739104bfb
http://ieeexplore.ieee.org/document/7964679/
https://ieeexplore.ieee.org/document/7964679/
https://doi.org/10.1109/ACCESS.2017.2722228
https://dblp.uni-trier.de/db/journals/access/access5.html#ZhuYGC17

An FPTAS for the fractional group Steiner tree problem

Autoren: Jelić, Slobodan

Quelle: Croatian Operational Research Review, Vol 6, Iss 2, Pp 525-539 (2015)
Croatian Operational Research Review
Volume 6
Issue 2

Schlagwörter: T57-57.97, Applied mathematics. Quantitative methods, packing linear program, fractional group Steiner tree problem, covering linear program, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, group Steiner tree problem, 16. Peace & justice, 01 natural sciences, Lagrangean relaxation, covering linear program, fractional group Steiner tree problem, approximation algorithm, fully polynomial time approximation scheme

Dateibeschreibung: application/pdf

Zugangs-URL: https://hrcak.srce.hr/file/218184
https://www.bib.irb.hr/785748
https://doi.org/10.17535/crorr.2015.0039
https://doaj.org/article/4440cc79bccf4382a1ecf00947c7210f
https://hrcak.srce.hr/index.php?show=clanak&id_clanak_jezik=218184&lang=en
https://core.ac.uk/display/91987413
https://www.bib.irb.hr/785748
https://hrcak.srce.hr/file/218184
http://hrcak.srce.hr/ojs/index.php/crorr/article/view/3659
https://hrcak.srce.hr/148278
https://hrcak.srce.hr/file/218184
https://doi.org/10.17535/crorr.2015.0039
https://hrcak.srce.hr/148278
https://doi.org/10.17535/crorr.2015.0039

A new graphical approach for solving single-machine scheduling problems approximately

Autoren: Gafarov, Evgeny R. Dolgui, Alexandre Werner, Frank et al.

Weitere Verfasser: Gafarov, Evgeny R. Dolgui, Alexandre Werner, Frank et al.

Quelle: International Journal of Production Research. 52:3762-3777

Schlagwörter: total weighted tardiness, 0211 other engineering and technologies, fully polynomial\-time approximation scheme, single\-machine scheduling, [INFO.INFO-MO] Computer Science [cs]/Modeling and Simulation, 02 engineering and technology, graphical algorithm, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, 3. Good health

Zugangs-URL: https://hal-emse.ccsd.cnrs.fr/emse-00998451
http://www.math.uni-magdeburg.de/~werner/GDLW_210313.pdf
https://www.tandfonline.com/doi/full/10.1080/00207543.2014.922708

Scheduling resumable deteriorating jobs on a single machine with non-availability constraints

Autoren: Li Zhou Baoqiang Fan Shisheng Li et al.

Quelle: Theoretical Computer Science. 412:275-280

Schlagwörter: Non-availability constraint, Scheduling, Deteriorating job, 0211 other engineering and technologies, 02 engineering and technology, Fully polynomial-time approximation scheme, Theoretical Computer Science, Computer Science(all)

Zugangs-URL: https://dblp.uni-trier.de/db/journals/tcs/tcs412.html#FanLZZ11
https://www.sciencedirect.com/science/article/pii/S0304397510004962#!
https://www.sciencedirect.com/science/article/pii/S0304397510004962
https://core.ac.uk/display/82420989

Parallel-machine scheduling with deteriorating jobs and rejection

Autoren: Jinjiang Yuan Shisheng Li

Quelle: Theoretical Computer Science. 411:3642-3650

Schlagwörter: Deteriorating jobs, Scheduling, 0211 other engineering and technologies, 02 engineering and technology, Fully polynomial-time approximation scheme, Rejection, Theoretical Computer Science, Computer Science(all)

Zugangs-URL: https://dblp.uni-trier.de/db/journals/tcs/tcs411.html#LiY10
https://www.sciencedirect.com/science/article/pii/S0304397510003427
https://core.ac.uk/display/82465670

Single-machine scheduling under the job rejection constraint

Autoren: Liqi Zhang Jinjiang Yuan Lingfa Lu

Quelle: Theoretical Computer Science. 411:1877-1882

Schlagwörter: Rejection penalty, Scheduling, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Fully polynomial-time approximation scheme, 01 natural sciences, Theoretical Computer Science, Computer Science(all)

Zugangs-URL: https://www.sciencedirect.com/science/article/abs/pii/S0304397510000903
https://core.ac.uk/display/82730059
https://dblp.uni-trier.de/db/journals/tcs/tcs411.html#ZhangLY10
https://www.sciencedirect.com/science/article/pii/S0304397510000903
https://doi.org/10.1016/j.tcs.2010.02.006
https://dl.acm.org/doi/10.1016/j.tcs.2010.02.006

A note on graph balancing problems with restrictions

Autoren: Lee, K Leung, JYT Pinedo, ML

Weitere Verfasser: Lee, K Leung, JYT Pinedo, ML

Quelle: Information Processing Letters. 110:24-29

Schlagwörter: Parallel machines scheduling, 0211 other engineering and technologies, OUTDEGREE, 0102 computer and information sciences, 02 engineering and technology, Approximation algorithm, 7. Clean energy, 01 natural sciences, Combinatorial problems, Eligibility constraints, Computational complexity, PROCESSING SET RESTRICTIONS, Fully polynomial time approximation scheme (FPTAS), APPROXIMATION ALGORITHMS, Graph balancing, PARALLEL MACHINES

Zugangs-URL: https://dblp.uni-trier.de/db/journals/ipl/ipl110.html#LeeLP09a
https://researchwith.njit.edu/en/publications/a-note-on-graph-balancing-problems-with-restrictions
https://www.sciencedirect.com/science/article/pii/S002001900900283X

Interdependent defense games with applications to Internet security at the level of autonomous systems

Autoren: Chan, Hau Ceyko, Michael Ortiz, Luis

Schlagwörter: ddc:330, computational game theory, interdependent security, equilibrium computation, equilibrium characterization, fully polynomial-time approximation scheme, learning in games, autonomous-systems internet security application

Relation: http://hdl.handle.net/10419/168015

Verfügbarkeit: http://hdl.handle.net/10419/168015
https://doi.org/10.3390/g8010013

FPTAS for half-products minimization with scheduling applications

Autoren: Erel, E. Ghosh J.B.

Quelle: Discrete Applied Mathematics

Schlagwörter: Pseudo-boolean functions, Approximation scheme, Dynamic Programming, Scheduling, Polynomial approximation, Applied Mathematics, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Approximation Scheme, Half-products, Np-hard, Dynamic programming, 01 natural sciences, Special class, Nuclear propulsion, Fully polynomial time approximation scheme, Quadratic Pseudo-boolean Functions, Quadratic pseudo-boolean functions, Discrete Mathematics and Combinatorics, Boolean functions

Dateibeschreibung: application/pdf

Zugangs-URL: https://hdl.handle.net/11693/23041
https://hdl.handle.net/11693/11652

The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan

Autoren: Jinjiang Yuan Liqi Zhang Lingfa Lu

Quelle: Theoretical Computer Science. 396:283-289

Schlagwörter: Rejection penalty, Scheduling, 0211 other engineering and technologies, 02 engineering and technology, Fully polynomial-time approximation scheme, Theoretical Computer Science, Computer Science(all)

Approximation Procedures for the One-Warehouse Multi-Retailer System: Approximation procedures for the one-warehouse multi-retailer system

Autoren: Lu Lu Marc E. Posner

Quelle: Management Science. 40:1305-1316

Schlagwörter: Transportation, logistics and supply chain management, stationary interval policies, fully polynomial-time approximation scheme, 0211 other engineering and technologies, heuristic procedures, 02 engineering and technology, one-warehouse multi-retailer system, one-warehouse multi-retailer system, relative error, fully polynomial-time approximation scheme

Dateibeschreibung: application/xml

Zugangs-URL: https://www.jstor.org/stable/2661624
https://pubsonline.informs.org/doi/10.1287/mnsc.40.10.1305
https://ideas.repec.org/a/inm/ormnsc/v40y1994i10p1305-1316.html
https://econpapers.repec.org/RePEc:inm:ormnsc:v:40:y:1994:i:10:p:1305-1316

Lot-sizing with non-stationary cumulative capacities

Autoren: Department of Industrial and Systems Engineering, University of Florida, P.O. Box 116595, Gainesville, FL 32611-6595 USA ( host institution ) Sargut, F. Zeynep Romeijn, H. Edwin

Quelle: Operations Research Letters. 35:549-557

Schlagwörter: 0502 economics and business, 05 social sciences, 0211 other engineering and technologies, 02 engineering and technology, Fully polynomial-time approximation scheme, Dynamic programming, Capacitated lot-sizing

Dateibeschreibung: [Elsevier APIv3]

Zugangs-URL: https://dl.acm.org/doi/10.1016/j.orl.2006.09.004
https://doi.org/10.1016/j.orl.2006.09.004
https://dblp.uni-trier.de/db/journals/orl/orl35.html#SargutR07
https://www.sciencedirect.com/science/article/pii/S0167637706001039

Positive half-products and scheduling with controllable processing times

Autoren: Wieslaw Kubiak Adam Janiak Mikhail Y. Kovalyov et al.

Quelle: European Journal of Operational Research. 165:416-422

Schlagwörter: Computational complexity, Single machine scheduling, Complexity and performance of numerical algorithms, Deterministic scheduling theory in operations research, Fully polynomial time approximation scheme, 0211 other engineering and technologies, Pseudo-Boolean optimization, 0102 computer and information sciences, 02 engineering and technology, Approximation methods and heuristics in mathematical programming, 01 natural sciences, Controllable processing times

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/2160297
https://doi.org/10.1016/j.ejor.2004.04.012
https://econpapers.repec.org/article/eeeejores/v_3a165_3ay_3a2005_3ai_3a2_3ap_3a416-422.htm
https://ideas.repec.org/a/eee/ejores/v165y2005i2p416-422.html
https://dblp.uni-trier.de/db/journals/eor/eor165.html#JaniakKKW05
https://www.sciencedirect.com/science/article/pii/S0377221704002504
https://doi.org/10.1016/j.ejor.2004.04.012

The approximability of the weighted Hamiltonian path completion problem on a tree

Autoren: Chin Lung Lu Richard Chia Tung Lee Quincy Wu

Quelle: Theoretical Computer Science. 341:385-397

Schlagwörter: 0102 computer and information sciences, 02 engineering and technology, Strongly NP-hard, Fully polynomial-time approximation scheme, Approximation algorithm, 01 natural sciences, Approximation algorithms, Trees, Theoretical Computer Science, Hamiltonian path completion problem, Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects), 0202 electrical engineering, electronic engineering, information engineering, Paths and cycles, Computer Science(all)

Dateibeschreibung: application/xml