Suchergebnisse - "strongly polynomial time algorithm"

On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs

Autoren: Del Pia, Alberto Di Gregorio, Silvia

Quelle: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977073

Schlagwörter: ddc:510, ddc:004, FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Binäre polynomielle Optimierung, Algorithmus mit stark polynomialer Zeit, Azyklische Hypergraphen, Härte der Approximation, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Binary polynomial optimization, Strongly polynomial-time algorithm, Acyclic hypergraphs, Hardness of approximation, Optimization and Control (math.OC), FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Mathematics - Optimization and Control, Computer Science - Discrete Mathematics

Zugangs-URL: http://arxiv.org/pdf/2007.05861
http://arxiv.org/abs/2007.05861
https://tud.qucosa.de/api/qucosa:89201/attachment/ATT-0/
https://tud.qucosa.de/id/qucosa:89201

A STRONGLY POLYNOMIAL TIME ALGORITHM FOR AN LP PROBLEM WITH A PRE-LEONTIEF COEFFICIENT MATRIX

Autoren: Akira Nakayama Tsutomu Anazawa Yudai Iwaki

Quelle: Journal of the Operations Research Society of Japan. 2022, 65(1):23

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 faster capacity scaling algorithm for minimum cost submodular flow

Autoren: FLEISCHER, Lisa IWATA, Satoru McCORMICK, Thomas et al.

Weitere Verfasser: FLEISCHER, Lisa IWATA, Satoru McCORMICK, Thomas et al.

Quelle: Mathematical Programming. 92:119-139

Schlagwörter: Combinatorial optimization, Shortest paths, Strongly polynomial time algorithm, 0211 other engineering and technologies, Submodular flow, 0102 computer and information sciences, 02 engineering and technology, submodular flow, shortest paths, strongly polynomial time algorithm, 01 natural sciences

Dateibeschreibung: application/xml

Zugangs-URL: http://alfresco.uclouvain.be/alfresco/download/attach/workspace/SpacesStore/236aaf1f-23d0-4e59-8ac5-31320c445e04/coredp_1999_47.pdf
http://www.cs.dartmouth.edu/~lkf/papers/subflow.pdf
https://www.research.ibm.com/people/l/lkf/papers/subflow.pdf
https://link.springer.com/article/10.1007%2Fs101070100253
https://dblp.uni-trier.de/db/journals/mp/mp92.html#FleischerIM02
https://dial.uclouvain.be/pr/boreal/object/boreal:4059
https://hdl.handle.net/2078.1/4059
http://alfresco.uclouvain.be/alfresco/download/attach/workspace/SpacesStore/236aaf1f-23d0-4e59-8ac5-31320c445e04/coredp_1999_47.pdf

The subdivision-constrained minimum spanning tree problem

Autoren: Weidong Li Zhongxu Zhang Tongquan Zhang et al.

Quelle: Theoretical Computer Science. 410:877-885

Schlagwörter: Spanning tree, Strongly polynomial time algorithm, 0211 other engineering and technologies, Subdivision tree, 0102 computer and information sciences, 02 engineering and technology, Polynomial equivalence, 01 natural sciences, Theoretical Computer Science, Computer Science(all)

Zugangs-URL: https://dblp.uni-trier.de/db/journals/tcs/tcs410.html#LiLZZ09
http://www.sciencedirect.com/science/article/pii/S0304397508008839
https://core.ac.uk/display/82389040
https://www.sciencedirect.com/science/article/pii/S0304397508008839

A faster capacity scaling algorithm for minimum cost submodular flow

Autoren: Lisa Fleischer Satoru Iwata S. Thomas Mccormick et al.

Weitere Verfasser: Lisa Fleischer Satoru Iwata S. Thomas Mccormick et al.

Quelle: http://www.core.ucl.ac.be/services/psfiles/dp99/dp9947.pdf.

Schlagwörter: submodular flow, shortest paths, strongly polynomial time algorithm

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.8928; http://www.core.ucl.ac.be/services/psfiles/dp99/dp9947.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.8928
http://www.core.ucl.ac.be/services/psfiles/dp99/dp9947.pdf

On Finding Primal- and Dual-Optimal Bases: On finding primal- and dual-optimal bases

Autoren: Nimrod Megiddo

Quelle: ORSA Journal on Computing. 3:63-65

Schlagwörter: Linear programming, Computational methods for problems pertaining to operations research and mathematical programming, 0211 other engineering and technologies, strongly polynomial time algorithm, 02 engineering and technology, 0101 mathematics, Abstract computational complexity for mathematical programming problems, 01 natural sciences

Dateibeschreibung: application/xml

Zugangs-URL: http://theory.stanford.edu/%7Emegiddo/pdf/primdual.pdf
https://zbmath.org/124248
https://doi.org/10.1287/ijoc.3.1.63

A faster capacity scaling algorithm for minimum cost submodular flow

Autoren: Fleischer, Lisa Iwata, Satoru McCormick, Thomas et al.

Weitere Verfasser: Fleischer, Lisa Iwata, Satoru McCormick, Thomas et al.

Schlagwörter: Submodular flow, Shortest paths, Strongly polynomial time algorithm

Relation: boreal:4059; http://hdl.handle.net/2078.1/4059

Verfügbarkeit: http://hdl.handle.net/2078.1/4059

A Faster Strongly Polynomial Minimum Cost Flow Algorithm: A faster strongly polynomial minimum cost flow algorithm

Autoren: Orlin, James B., 1953-.

Quelle: Operations Research. 41:338-350

Schlagwörter: shortest path, scaling, Deterministic network models in operations research, 0211 other engineering and technologies, HD28 .M414 no.3060-, 89, strongly polynomial time algorithm, uncapacitated minimum cost flow, 0102 computer and information sciences, 02 engineering and technology, Abstract computational complexity for mathematical programming problems, 01 natural sciences, HD28 .M414 no.2042-, 88, minimum cost flow

Dateibeschreibung: application/xml

Zugangs-URL: https://dspace.mit.edu/bitstream/1721.1/2206/1/SWP-2042-18974539.pdf
https://zbmath.org/243546
https://doi.org/10.1287/opre.41.2.338
https://dl.acm.org/citation.cfm?id=62249
http://www.dtic.mil/dtic/tr/fulltext/u2/a457043.pdf
https://apps.dtic.mil/sti/citations/ADA457044
https://www.jstor.org/stable/171782
https://core.ac.uk/display/4379866
https://dspace.mit.edu/handle/1721.1/2206
http://hdl.handle.net/1721.1/2265
http://hdl.handle.net/1721.1/2206

Variants of Shortest Path Problems

Autoren: Turner, Lara

Quelle: Algorithmic Operations Research; Vol. 6 No. 2 (2011); Pages 91 - 104 ; 1718-3235

Schlagwörter: shortest path problem, universal objective function, resource constrained shortest path problem, strongly polynomial-time algorithm

Dateibeschreibung: application/pdf

Relation: https://journals.lib.unb.ca/index.php/AOR/article/view/18312/20525; https://journals.lib.unb.ca/index.php/AOR/article/view/18312

Verfügbarkeit: https://journals.lib.unb.ca/index.php/AOR/article/view/18312

Variants of the Shortest Path Problem

Autoren: Turner, Lara (Dipl.-Math.)

Schlagwörter: Shortest path problem, strongly polynomial-time algorithm, resource constrained shortest path problem, ddc:510, universal objective function

Dateibeschreibung: application/pdf

Zugangs-URL: https://kluedo.ub.uni-kl.de/files/2713/140_LaraTurner.pdf
https://kluedo.ub.rptu.de/frontdoor/index/index/docId/2713

흐름의 팽창과 수축이 있는 네트워크에서 최단확산경로문제에 관한 연구 ; A Study on the shortest diffusion path problem in network flows with gains and losses

Autoren: 정의석 정성진 産業工學科

Weitere Verfasser: 정의석 정성진 産業工學科

Schlagwörter: 일반화된 네트워크, generalized network, 최단확산경로문제, shortest diffusion path problem, 강성다항식해법, diffusion inequalitied, 확산부등식, LI(2), 2항선형부등식, strongly polynomial time algorithm

Dateibeschreibung: v, 101 장

Relation: http://dcollection.snu.ac.kr:80/jsp/common/DcLoOrgPer.jsp?sItemId=000000082716; https://hdl.handle.net/10371/50606

Verfügbarkeit: https://hdl.handle.net/10371/50606
http://dcollection.snu.ac.kr:80/jsp/common/DcLoOrgPer.jsp?sItemId=000000082716

Partial Inverse Most Unbalanced Spanning Tree Problem

Autoren: Wang, Q.

Quelle: Przegląd Elektrotechniczny.

Schlagwörter: grafy, drzewo rozpinające, most unbalanced spanning tree, forest, computational complexity, strongly polynomial time algorithm

Zugangs-URL: http://yadda.icm.edu.pl/baztech/element/bwmeta1.element.baztech-article-BPOB-0049-0024

Variants of the Shortest Path Problem

Autoren: Turner, Lara

Verfügbarkeit: http://data.europeana.eu/aggregation/europeana/2048441/item_H7KEYGALCHDSHANVRSA6KEIV6EK6HXY3
http://data.europeana.eu/item/2048441/item_H7KEYGALCHDSHANVRSA6KEIV6EK6HXY3

Variants of the Shortest Path Problem

Autoren: Turner, Lara (Dipl.-Math.)

Index Begriffe: Shortest path problem, universal objective function, resource constrained shortest path problem, strongly polynomial-time algorithm, ddc:510, preprint

Variants of the Shortest Path Problem

Autoren: Turner, Lara (Dipl.-Math.)

Index Begriffe: Shortest path problem, universal objective function, resource constrained shortest path problem, strongly polynomial-time algorithm, ddc:510, preprint

Variants of the Shortest Path Problem

Autoren: Turner, Lara (Dipl.-Math.)

Index Begriffe: Shortest path problem, universal objective function, resource constrained shortest path problem, strongly polynomial-time algorithm, ddc:510, preprint