Suchergebnisse - "pseudo-polynomial time algorithm"

Fundamental properties and pseudo-polynomial-time algorithm for network containership sailing speed optimization

Autoren: Shuaian Wang Department of Logistics and Maritime Studies

Weitere Verfasser: Shuaian Wang Department of Logistics and Maritime Studies

Quelle: European Journal of Operational Research. 250:46-55

Schlagwörter: Bunker fuel, Sailing speed, 0502 economics and business, 05 social sciences, 0211 other engineering and technologies, Transportation, 02 engineering and technology, Containership, Liner shipping

Zugangs-URL: http://ira.lib.polyu.edu.hk/handle/10397/55767
https://dblp.uni-trier.de/db/journals/eor/eor250.html#Wang16
https://econpapers.repec.org/RePEc:eee:ejores:v:250:y:2016:i:1:p:46-55
https://ideas.repec.org/a/eee/ejores/v250y2016i1p46-55.html
https://www.sciencedirect.com/science/article/pii/S0377221715009789
https://core.ac.uk/display/61223730

A Pseudo-Polynomial Time Algorithm for a Special Multiobjective Order Picking Problem

Autoren: Cansu Kandemir Özgür Özpeynirci

Quelle: International Journal of Information Technology & Decision Making. 14:1111-1128

Schlagwörter: 0209 industrial biotechnology, 0211 other engineering and technologies, 02 engineering and technology

A pseudo-polynomial time algorithm for solving the resource dependent assignment problem

Autoren: George Steiner Dvir Shabtay Liron Yedidsion

Quelle: Discrete Applied Mathematics. 182:115-121

Schlagwörter: 13. Climate action, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, 7. Clean energy, 12. Responsible consumption

Zugangs-URL: https://www.sciencedirect.com/science/article/pii/S0166218X13003788
https://www.sciencedirect.com/science/article/abs/pii/S0166218X13003788
https://dblp.uni-trier.de/db/journals/dam/dam182.html#ShabtaySY15

Pseudo-Polynomial Time Algorithm for Computing Moments of Polynomials in Free Semicircular Elements

Autoren: Mizuta, Rei

Schlagwörter: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Probability (math.PR), Mathematics - Operator Algebras, FOS: Mathematics, Data Structures and Algorithms (cs.DS), 0101 mathematics, Operator Algebras (math.OA), 01 natural sciences, Mathematics - Probability

Zugangs-URL: http://arxiv.org/abs/1901.08210

A Pseudo-Polynomial Time Algorithm for Solving the Knapsack Problem in Polynomial Space

Autoren: Noriyuki Fujimoto

Quelle: Lecture Notes in Computer Science ISBN: 9783319487489

Zugangs-URL: http://dblp.uni-trier.de/db/conf/cocoa/cocoa2016.html#Fujimoto16
https://rd.springer.com/chapter/10.1007/978-3-319-48749-6_45
https://link.springer.com/chapter/10.1007/978-3-319-48749-6_45
https://dblp.uni-trier.de/db/conf/cocoa/cocoa2016.html#Fujimoto16

Pseudo-Polynomial-Time Algorithm

Quelle: Encyclopedia of Operations Research and Management Science ISBN: 9781441911377

Pseudo-polynomial-time algorithm

Pseudo-polynomial-time algorithm

Autoren: Saul I. Gass Carl M. Harris

Quelle: Encyclopedia of Operations Research and Management Science ISBN: 9780792378273

Single-machine scheduling with machine unavailability periods and resource dependent processing times

Autoren: Dvir Shabtay

Quelle: European Journal of Operational Research. 296:423-439

Schlagwörter: controllable processing time, machine unavailability period, Deterministic scheduling theory in operations research, single-machine scheduling, pseudo polynomial time algorithm, 0211 other engineering and technologies, resource allocation, 02 engineering and technology, approximation algorithms, 12. Responsible consumption

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/7422936
https://doi.org/10.1016/j.ejor.2021.03.034
https://www.sciencedirect.com/science/article/pii/S0377221721002605
https://doi.org/10.1016/j.ejor.2021.03.034
https://dblp.uni-trier.de/db/journals/eor/eor296.html#Shabtay22

Supply chain scheduling with receiving deadlines and non-linear penalty

Autoren: Wang, G Lei, L Lee, K

Weitere Verfasser: Wang, G Lei, L Lee, K

Quelle: Journal of the Operational Research Society. 66:380-391

Schlagwörter: dynamic programming, pseudo-polynomial time algorithm, capacitated facilities, deadline constraints, 0211 other engineering and technologies, 02 engineering and technology, operations scheduling, 3. Good health

Zugangs-URL: http://www.palgrave-journals.com/jors/journal/v66/n3/pdf/jors20142a.pdf
http://www.palgrave-journals.com/jors/journal/v66/n3/full/jors20142a.html

Single-machine scheduling with trade-off between number of tardy jobs and compression cost

Autoren: He, Y Wei, Q Cheng, TCE et al.

Weitere Verfasser: He, Y Wei, Q Cheng, TCE et al.

Quelle: Journal of Scheduling. 10:303-310

Schlagwörter: pseudo-polynomial time algorithm, controllable processing times, Single-machine scheduling problem, Deterministic scheduling theory in operations research, Strongly polynomial time algorithm, 8. Economic growth, 0211 other engineering and technologies, Pseudo-polynomial time algorithm, strongly polynomial time algorithm, 02 engineering and technology, single-machine scheduling problem, Controllable processing times

Dateibeschreibung: application/xml

Zugangs-URL: https://link.springer.com/article/10.1007/s10951-007-0027-7
https://core.ac.uk/display/61007599
https://ira.lib.polyu.edu.hk/handle/10397/1143
https://research.polyu.edu.hk/en/publications/single-machine-scheduling-with-trade-off-between-number-of-tardy-

A Pseudo-Polynomial Time Algorithm for Solving the Knapsack Problem in Polynomial Space.

Autoren: Fujimoto, Noriyuki

Quelle: Combinatorial Optimization & Applications: 10th International Conference, COCOA 2016, Hong Kong, China, December 16-18, 2016, Proceedings; 2016, p624-638, 15p

Scheduling with step learning and job rejection: Scheduling with step learning and job rejection: J. Song et al.

Autoren: Song, Jiaxin Miao, Cuixia Kong, Fanyu

Quelle: Operational Research; Mar2025, Vol. 25 Issue 1, p1-18, 18p

on the complexity of non preemptive shop scheduling with two jobs: On the complexity of non-preemptive shop scheduling with two jobs

Autoren: Tamás Kis

Quelle: Computing. 69(1):37-49

Schlagwörter: pseudo-polynomial time algorithm, computational complexity, Deterministic scheduling theory in operations research, mixed shop scheduling

Dateibeschreibung: application/xml

Zugangs-URL: https://link.springer.com/article/10.1007/s00607-002-1455-z
http://eprints.sztaki.hu/3016/
https://doi.org/10.1007/s00607-002-1455-z
https://link.springer.com/content/pdf/10.1007/s00607-002-1455-z.pdf
https://dblp.uni-trier.de/db/journals/computing/computing69.html#Kis02

A Pseudo-Polynomial Time Algorithm for a Special Multiobjective Order Picking Problem.

Autoren: Özpeynirci, Özgür Kandemir, Cansu

Quelle: International Journal of Information Technology & Decision Making; Sep2015, Vol. 14 Issue 5, p1111-1128, 18p

Schlagwörter: ALGORITHMS, POLYNOMIALS, WAREHOUSES, ALGEBRA

The complexity of mean payoff games on graphs

Autoren: Uri Zwick Mike Paterson

Quelle: Theoretical Computer Science. 158:343-359

Schlagwörter: pseudo-polynomial time algorithm, 0209 industrial biotechnology, Graph theory (including graph drawing) in computer science, polynomial reduction, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Game theory, Theoretical Computer Science, Computer Science(all)

Dateibeschreibung: application/xml

Zugangs-URL: https://dl.acm.org/doi/10.1016/0304-3975%2895%2900188-3
http://www.sciencedirect.com/science/article/pii/0304397595001883
https://dblp.uni-trier.de/db/journals/tcs/tcs158.html#ZwickP96
https://core.ac.uk/display/82224004
https://www.sciencedirect.com/science/article/pii/0304397595001883
https://www.sciencedirect.com/science/article/abs/pii/0304397595001883

Discrete Optimal Transport with Independent Marginals is #P-Hard

Autoren: Taskesen, Bahar Shafieezadeh Abadeh, Soroosh Kuhn, Daniel et al.

Schlagwörter: Optimal transport, Wasserstein distance, Complexity theory, Pseudo-polynomial time algorithm

Relation: SIAM Journal on Optimization; https://infoscience.epfl.ch/handle/20.500.14299/185983; 2203.01161

Verfügbarkeit: https://doi.org/10.1137/22M1482044
https://infoscience.epfl.ch/handle/20.500.14299/185983
https://hdl.handle.net/20.500.14299/185983

Parallel-batching scheduling with two agents, release dates and equal processing times.

Autoren: Li, Shi-Sheng Chen, Ren-Xia

Quelle: International Journal of Production Research. Jun2025, p1-22. 22p.

Schlagwörter: *SCHEDULING, *PARETO optimum, *BATCH processing, NP-hard problems, APPROXIMATION algorithms

A primal‐dual algorithm for the minimum average weighted length circuit problem: A primal-dual algorithm for the minimum average weighted length circuit problem

Autoren: Chengen Yang Dayong Jin

Quelle: Networks. 21:705-712

Schlagwörter: pseudo-polynomial time algorithm, 0211 other engineering and technologies, minimum average weighted length circuit problem, 0102 computer and information sciences, 02 engineering and technology, Programming involving graphs or networks, Abstract computational complexity for mathematical programming problems, 01 natural sciences

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/25950
https://doi.org/10.1002/net.3230210702
https://dblp.uni-trier.de/db/journals/networks/networks21.html#YangJ91
http://onlinelibrary.wiley.com/doi/10.1002/net.3230210702/abstract

Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights: Weighted-tardiness scheduling on parallel machines with proportional weights

Autoren: Robin O. Roundy Esther M. Arkin

Quelle: Operations Research. 39:64-81

Schlagwörter: Deterministic scheduling theory in operations research, single machine, parallel machines, total weighted tardiness, Computational methods for problems pertaining to operations research and mathematical programming, heuristic, pseudo- polynomial time algorithm

Dateibeschreibung: application/xml