Suchergebnisse - "pseudo-polynomial algorithm"

Alternative definition of the strong NP-completeness ; Альтернативное определение NP-полноты в сильном смысле

Autoren: Ya. M. Shafransky Я. М. Шафранский

Quelle: Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series; Том 60, № 4 (2024); 303-308 ; Известия Национальной академии наук Беларуси. Серия физико-математических наук; Том 60, № 4 (2024); 303-308 ; 2524-2415 ; 1561-2430 ; 10.29235/1561-2430-2024-60-4

Schlagwörter: NP-полнота в сильном смысле, pseudo-polynomial algorithm, class NP, NP-completeness, strong NP-completeness, псевдополиномиальный алгоритм, класс NP, NP-полнота

Dateibeschreibung: application/pdf

Relation: https://vestifm.belnauka.by/jour/article/view/810/618; Garey, M. R. “Strong” NP-completeness results: motivation, examples, and implications / M. R. Garey, D. S. Johnson // J. Ass. Comput. Machinery. – 1978. – Vol. 25, № 3. – P. 499–508. https://doi.org/10.1145/322077.322090; Garey, M. R. Computers and Intractability. A Guide to the Theory of NP-completeness / M. R. Garey, D. S. Johnson. – New York: W. H. Freeman and Company, 1979. – 348 p.; Webster, S. Note on “Parallel Machine Scheduling with Batch Setup Times” / S. Webster // Oper. Res. – 1998. – Vol. 46, № 3. – P. 423. https://doi.org/10.1287/opre.46.3.423; Shafransky, Y. M. On some contradictions in theory of computational complexity / Y. M. Shafransky // Third Workshop on Models and Algorithms for Planning and Scheduling. – Cambridge, 1997. – P. 42.; https://vestifm.belnauka.by/jour/article/view/810

Verfügbarkeit: https://vestifm.belnauka.by/jour/article/view/810
https://doi.org/10.29235/1561-2430-2024-60-4-303-308

An Efficient Real-Time Algorithm for Placing Electronic Components on Panel

Autoren: Huyghe, Catherine Negre, Stephane Fontaine, Melanie et al.

Weitere Verfasser: Huyghe, Catherine Negre, Stephane Fontaine, Melanie et al.

Quelle: ISSN: 1790-0832.

Schlagwörter: bin packing problem, heuristic, dynamical programming algorithm, pseudo-polynomial algorithm, lower bound, operational research, combinatorial problem, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC]

Verfügbarkeit: https://hal.science/hal-04532124
https://hal.science/hal-04532124v1/document
https://hal.science/hal-04532124v1/file/WSEAS2024.pdf
https://doi.org/10.37394/23209.2024.21.14

Single-machine scheduling with an external resource

Autoren: Briskorn, Dirk Davari, Morteza Matuschke, Jannik

Quelle: European Journal of Operational Research. 293:457-468

Schlagwörter: FOS: Computer and information sciences, Technology, Operations Research, Discrete Mathematics (cs.DM), BOUNDS, 0211 other engineering and technologies, Social Sciences, Pseudo-polynomial algorithm, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 46 Information and computing sciences, 01 natural sciences, Business & Economics, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), RENTING PROBLEM, 40 Engineering, Science & Technology, Scheduling, SUBJECT, Operations Research & Management Science, Complexity, Single-machine scheduling, Management, Computer Science - Computational Complexity, External resource, 8. Economic growth, 49 Mathematical sciences, Computer Science - Discrete Mathematics

Zugangs-URL: http://arxiv.org/pdf/2006.03399
http://arxiv.org/abs/2006.03399
http://ui.adsabs.harvard.edu/abs/2020arXiv200603399B/abstract
https://dblp.uni-trier.de/db/journals/corr/corr2006.html#abs-2006-03399
https://dblp.uni-trier.de/db/journals/eor/eor293.html#BriskornDM21
https://doi.org/10.1016/j.ejor.2020.12.045
https://arxiv.org/pdf/2006.03399
https://www.sciencedirect.com/science/article/pii/S0377221720310912
https://lirias.kuleuven.be/handle/123456789/666234
https://doi.org/10.1016/j.ejor.2020.12.045

INTERVAL VERTEX-COLORINGS OF CACTUS GRAPHS WITH RESTRICTIONS ON VERTICES

Autoren: Sahakyan, Albert Kh. Kamalian, Rafayel R.

Quelle: Proceedings of the YSU A: Physical and Mathematical Sciences; Vol. 55 No. 3 (256) (2021); 160-168 ; ԵՊՀ Գիտական տեղեկագիր․ Ֆիզմաթ գիտություններ; Vol. 55 No. 3 (256) (2021); 160-168 ; ԵՊՀ Գիտական տեղեկագիր. Ֆիզիկա և մաթեմատիկա; Vol. 55 No. 3 (256) (2021); 160-168 ; Ученые записки ЕГУ: физмат науки; Том 55 № 3 (256) (2021); 160-168 ; 2953-7975 ; 1829-1740 ; 10.46991/PYSU:A/2021.55.3

Schlagwörter: cactus graphs, trees, interval vertex-coloring, list coloring, dynamic programming, pseudo-polynomial algorithm

Dateibeschreibung: application/pdf

Relation: https://journals.ysu.am/index.php/proceedings-phys-math/article/view/vol55_no3_2021_pp160-168/pdf

Verfügbarkeit: https://journals.ysu.am/index.php/proceedings-phys-math/article/view/vol55_no3_2021_pp160-168
https://doi.org/10.46991/PYSU:A/2021.55.3.160

Approximation schemes for a class of subset selection problems

Autoren: Gerhard J. Woeginger Kirk Pruhs

Quelle: Lecture Notes in Computer Science ISBN: 9783540212584

Schlagwörter: Approximation scheme, Combinatorial optimization, Single Machine, Scheduling theory, Knapsack Problem, 0211 other engineering and technologies, Schedule Problem, Pseudo-polynomial algorithm, 0102 computer and information sciences, 02 engineering and technology, Approximation Scheme, 16. Peace & justice, Approximation algorithm, 01 natural sciences, Theoretical Computer Science, Combinatorial Optimization Problem, METIS-219783, Worst case analysis, FPTAS, Computer Science(all)

Zugangs-URL: https://ris.utwente.nl/ws/files/52019593/Pruhs2004Approximation1.pdf
https://research.utwente.nl/en/publications/92dc9a9b-9a37-4e4c-83ef-4c2b32464846
https://doi.org/10.1007/978-3-540-24698-5_24
https://dblp.uni-trier.de/db/journals/tcs/tcs382.html#PruhsW07
https://core.ac.uk/display/82367085
https://rd.springer.com/chapter/10.1007/978-3-540-24698-5_24
https://dl.acm.org/doi/10.1016/j.tcs.2007.03.006
https://www.narcis.nl/publication/RecordID/oai%3Aris.utwente.nl%3Apublications%2F92dc9a9b-9a37-4e4c-83ef-4c2b32464846
https://link.springer.com/chapter/10.1007/978-3-540-24698-5_24
https://core.ac.uk/display/92048113
https://ris.utwente.nl/ws/files/52019593/Pruhs2004Approximation1.pdf
https://dblp.uni-trier.de/db/conf/latin/latin2004.html#PruhsW04
https://research.utwente.nl/en/publications/approximation-schemes-for-a-class-of-subset-selection-problems
https://link.springer.com/chapter/10.1007/978-3-540-24698-5_24

Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem

Autoren: Svetlana A. Kravchenko

Quelle: Discrete Applied Mathematics. 98:209-217

Schlagwörter: job-shop, Deterministic scheduling theory in operations research, Applied Mathematics, 0211 other engineering and technologies, Job-shop, Pseudo-polynomial algorithm, \(NP\)-hard problem, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, pseudo-polynomial algorithm, Discrete Mathematics and Combinatorics, NP-hard problem, Abstract computational complexity for mathematical programming problems

Dateibeschreibung: application/xml

Zugangs-URL: https://www.sciencedirect.com/science/article/pii/S0166218X99001651#!
https://www.sciencedirect.com/science/article/pii/S0166218X99001651
https://dblp.uni-trier.de/db/journals/dam/dam98.html#Kravchenko00a
https://doi.org/10.1016/S0166-218X(99)00165-1

Stochastic binary problems with simple penalties for capacity constraints violations

Autoren: Fortz, Bernard Labbé, M. Louveaux, F. et al.

Weitere Verfasser: Fortz, Bernard Labbé, M. Louveaux, F. et al.

Quelle: Mathematical Programming. 138:199-221

Schlagwörter: Business & economic sciences, 0211 other engineering and technologies, Branch-and-cut algorithm, Stochastic programming, Quantitative methods in economics & management, Mixed-integer non-linear programming, Pseudo-polynomial algorithm, 02 engineering and technology, Knapsack problem, Méthodes quantitatives en économie & gestion, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], Recherche opérationnelle, Sciences économiques & de gestion

Dateibeschreibung: 1 full-text file(s): application/pdf

Zugangs-URL: https://hal.archives-ouvertes.fr/hal-01255254/file/KnapsackForLabLouvPossMathProg.pdf
https://hdl.handle.net/2268/318178
https://doi.org/10.1007/s10107-012-0520-4

Simultaneous minimization of total completion time and total deviation of job completion times

Autoren: Gur Mosheiov

Quelle: European Journal of Operational Research. 157:296-306

Schlagwörter: 0209 industrial biotechnology, Multiple criteria, Deterministic scheduling theory in operations research, Scheduling, 0211 other engineering and technologies, Pseudo-polynomial algorithm, 02 engineering and technology, Single machine, Dynamic programming, Deterministic

Dateibeschreibung: application/xml

Zugangs-URL: https://www.sciencedirect.com/science/article/pii/S0377221703001930
https://ideas.repec.org/a/eee/ejores/v157y2004i2p296-306.html
https://doi.org/10.1016/S0377-2217(03)00193-0
https://econpapers.repec.org/article/eeeejores/v_3a157_3ay_3a2004_3ai_3a2_3ap_3a296-306.htm
https://dblp.uni-trier.de/db/journals/eor/eor157.html#Mosheiov04

Comments on: Static and dynamic source locations in undirected networks

Autoren: Carrizosa Priego, Emilio José Universidad de Sevilla. Departamento de Estadística e Investigación Operativa Universidad de Sevilla. FQM329: Optimización

Weitere Verfasser: Carrizosa Priego, Emilio José Universidad de Sevilla. Departamento de Estadística e Investigación Operativa Universidad de Sevilla. FQM329: Optimización

Quelle: idUS. Depósito de Investigación de la Universidad de Sevilla
instname
Universidad de Sevilla (US)
idUS: Depósito de Investigación de la Universidad de Sevilla

Schlagwörter: 2. Zero hunger, Tree network, Source location problem, Pseudo-polynomial algorithm, Fully polynomial-time approximation scheme, 16. Peace & justice, Dynamic flow, (Minimal) deficient set, Plural cover problem, (Dual) greedy algorithm, Single cover problem, NP-hardness, Linear algorithm, Matroid

Dateibeschreibung: application/pdf

Zugangs-URL: https://link.springer.com/content/pdf/10.1007%2Fs11750-015-0393-9.pdf
https://idus.us.es/handle//11441/107593
https://hdl.handle.net/11441/107593
https://ideas.repec.org/a/spr/topjnl/v23y2015i3p647-649.html
https://idus.us.es/handle/11441/107593
https://link.springer.com/article/10.1007/s11750-015-0393-9
https://econpapers.repec.org/article/sprtopjnl/v_3a23_3ay_3a2015_3ai_3a3_3ap_3a647-649.htm
https://dialnet.unirioja.es/servlet/articulo?codigo=6791037
https://link.springer.com/content/pdf/10.1007%2Fs11750-015-0393-9.pdf

A Pseudo-Polynomial Primal-Dual Algorithm for Globally Solving a Production-Transportation Problem: A pseudo-polynomial primal-dual algorithm for globally solving a production-transportation problem

Autoren: Takahiro Utsunomiya Takahito Kuno

Quelle: Journal of Global Optimization. 11:163-180

Schlagwörter: primal-dual algorithm, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, minimum linear-cost flow problem, 02 engineering and technology, Programming involving graphs or networks, Abstract computational complexity for mathematical programming problems, Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.), production-transportation problems, pseudo-polynomial algorithm

Dateibeschreibung: application/xml

Zugangs-URL: https://dblp.uni-trier.de/db/journals/jgo/jgo11.html#KunoU97
https://link.springer.com/article/10.1023%2FA%3A1008278625289
https://dl.acm.org/doi/10.1023/A%3A1008278625289

Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality: Simple and fast algorithms for linear and integer programs with two variables per inequality

Autoren: Hochbaum, Dorit S. Naor, Joseph

Quelle: SIAM Journal on Computing. 23:1179-1192

Schlagwörter: Combinatorial optimization, Analysis of algorithms and problem complexity, Fourier- Motzkin elimination, 0211 other engineering and technologies, Integer programming, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, pseudo-polynomial algorithm, fat polytopes, Graph algorithms (graph-theoretic aspects), Linear programming, feasibility in linear programs, Abstract computational complexity for mathematical programming problems

Dateibeschreibung: application/xml

Minimum cost multiflows in undirected networks

Autoren: Alexander V. Karzanov

Quelle: Mathematical Programming. 66:313-325

Schlagwörter: undirected graph, Deterministic network models in operations research, 0211 other engineering and technologies, pseudo- polynomial algorithm, half-integral optimal solution, edge-disjoint paths, 0102 computer and information sciences, 02 engineering and technology, minimum cost maximum multi(commodity) flow problem, \(c\)-admissible multiflow, 01 natural sciences

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/679578
https://doi.org/10.1007/bf01581152
https://link.springer.com/10.1007/BF01581152
https://dblp.uni-trier.de/db/journals/mp/mp66.html#Karzanov94
https://link.springer.com/article/10.1007/BF01581152

Simultaneous optimization of efficiency and performance balance measures in single-machine scheduling problems: Simultaneous optimization of efficiency and performance belance measures in single-machine scheduling problems

Autoren: Gur Mosheiov Awi Federgruen

Quelle: Naval Research Logistics. 40:951-970

Schlagwörter: manufacturing, Deterministic scheduling theory in operations research, single-machine job scheduling, service, Dynamic programming, aggregate efficiency measure, pseudo-polynomial algorithm

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/553762
https://doi.org/10.1002/1520-6750(199312)40:7<951::aid-nav3220400707>3.0.co;2-1
https://onlinelibrary.wiley.com/doi/pdf/10.1002/1520-6750%28199312%2940%3A7%3C951%3A%3AAID-NAV3220400707%3E3.0.CO%3B2-1

Random pseudo-polynomial algorithms for exact matroid problems

Autoren: P. M. Camerini F. Maffioli GALBIATI, GIULIA et al.

Weitere Verfasser: P. M. Camerini F. Maffioli GALBIATI, GIULIA et al.

Quelle: Journal of Algorithms. 13:258-273

Schlagwörter: Matroid Base, Analysis of algorithms and problem complexity, 4. Education, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Combinatorial aspects of matroids and geometric lattices, perfect matchings, 01 natural sciences, 7. Clean energy, pseudo-polynomial algorithm, weighted graphs, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Randomized Algorithm, matroid, Parity Conditions, Parallel algorithms in computer science

Dateibeschreibung: application/xml; STAMPA

Zugangs-URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.159.2290
https://www.sciencedirect.com/science/article/abs/pii/0196677492900188
http://dblp.uni-trier.de/db/journals/jal/jal13.html#CameriniGM92
https://core.ac.uk/display/21178947
https://dl.acm.org/doi/10.1016/0196-6774%2892%2990018-8
https://dblp.uni-trier.de/db/journals/jal/jal13.html#CameriniGM92

Scheduling around a small common due date

Autoren: Johannes Hoogeveen van de Sl Steef Velde

Quelle: European Journal of Operational Research. 55:237-242

Schlagwörter: prohibited interruptions, weighted sum of deviations, Deterministic scheduling theory in operations research, deadline, NP-hardness, due date, single machine scheduling, Abstract computational complexity for mathematical programming problems, Dynamic programming, pseudo-polynomial algorithm

Dateibeschreibung: application/xml

Zugangs-URL: https://repub.eur.nl/pub/12356/SchedulingAround_1991.pdf
https://www.narcis.nl/publication/RecordID/oai%3Apure.tue.nl%3Apublications%2F40d41b00-57a7-41c5-a4e1-62ed28642a88
https://econpapers.repec.org/article/eeeejores/v_3a55_3ay_3a1991_3ai_3a2_3ap_3a237-242.htm
https://www.sciencedirect.com/science/article/abs/pii/037722179190228N
https://repub.eur.nl/pub/12356
https://research.tue.nl/nl/publications/scheduling-around-a-small-common-due-date
https://repub.eur.nl/pub/12356/SchedulingAround_1991.pdf

Polymatroids: construction and random algorithms: Polymatroids: Construction and random algorithms

Autoren: M. Trubian P. M. Camerini

Quelle: Calcolo. 27:203-218

Schlagwörter: random pseudo-polynomial algorithm, Extended Exact Parity Base, 0102 computer and information sciences, Combinatorial aspects of matroids and geometric lattices, polymatroid, 01 natural sciences

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/24625
https://doi.org/10.1007/bf02575795
https://link.springer.com/article/10.1007/BF02575795

Stochastic binary problems with simple penalties for capacity constraints violations

Autoren: Fortz, Bernard Labbé, M. Louveaux, F. et al.

Quelle: Mathematical Programming, 138 (1-2), 199-221 (2013)

Schlagwörter: Stochastic programming, Knapsack problem, Pseudo-polynomial algorithm, Mixed-integer non-linear programming, Branch-and-cut algorithm, Business & economic sciences, Quantitative methods in economics & management, Sciences économiques & de gestion, Méthodes quantitatives en économie & gestion

Relation: https://www.scopus.com/inward/record.uri?eid=2-s2.0-84875435973&doi=10.1007%2fs10107-012-0520-4&partnerID=40&md5=d734befaf5067077949b2d7476f83cae; urn:issn:0025-5610; urn:issn:1436-4646

Zugangs-URL: https://orbi.uliege.be/handle/2268/318178

On the complexity of the exact weighted independent set problem

Autoren: Martin Milanič Jérôme Monnot The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Martin Milanič Jérôme Monnot The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.lamsade.dauphine.fr/sites/default/IMG/pdf/cahierLamsade258.pdf.

Schlagwörter: exact weighted independent set, NP-complete, pseudo-polynomial algorithm, modular

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.386.3605; http://www.lamsade.dauphine.fr/sites/default/IMG/pdf/cahierLamsade258.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.386.3605
http://www.lamsade.dauphine.fr/sites/default/IMG/pdf/cahierLamsade258.pdf

A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays

Autoren: Petra Schuurman

Quelle: Operations Research Letters. 23:9-11

Schlagwörter: minimum delays, Deterministic scheduling theory in operations research, single-machine scheduling, polynomial approximation, 0211 other engineering and technologies, precedence delays, 0102 computer and information sciences, 02 engineering and technology, Approximation methods and heuristics in mathematical programming, 01 natural sciences, pseudo-polynomial algorithm

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1347293
https://doi.org/10.1016/s0167-6377(98)00012-1
https://research.tue.nl/en/publications/8f3d321a-8e7d-47b3-b69f-8dd00f66eedd
https://doi.org/10.1016/S0167-6377(98)00012-1
https://dblp.uni-trier.de/db/journals/orl/orl23.html#Schuurman98
https://www.sciencedirect.com/science/article/pii/S0167637798000121
https://www.narcis.nl/publication/RecordID/oai%3Apure.tue.nl%3Apublications%2F8f3d321a-8e7d-47b3-b69f-8dd00f66eedd
https://doi.org/10.1016/S0167-6377(98)00012-1

On the complexity of the exact weighted independent set problem

Autoren: Milanic, Martin Monnot, Jérôme Rutgers Center for Operations Research (RUTCOR) et al.

Weitere Verfasser: Milanic, Martin Monnot, Jérôme Rutgers Center for Operations Research (RUTCOR) et al.

Quelle: https://hal.science/hal-00178135 ; 2007.

Schlagwörter: modular decomposition, exact weighted independent set, NP-complete, pseudo-polynomial algorithm, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC]

Verfügbarkeit: https://hal.science/hal-00178135
https://hal.science/hal-00178135v1/document
https://hal.science/hal-00178135v1/file/cahierLamsade258.pdf