Search Results - "Strongly polynomial time algorithm"
-
1
Authors:
Source: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977073
Subject Terms: 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
-
2
Authors:
Source: Journal of the Operations Research Society of Japan. 2022, 65(1):23
-
3
Authors: et al.
Contributors: et al.
Source: Journal of Scheduling. 10:303-310
Subject Terms: 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
File Description: application/xml
-
4
Authors: et al.
Contributors: et al.
Source: Mathematical Programming. 92:119-139
Subject Terms: 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
File Description: application/xml
Access 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 -
5
Authors: et al.
Source: Theoretical Computer Science. 410:877-885
Subject Terms: 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)
-
6
Authors: et al.
Contributors: et al.
Subject Terms: submodular flow, shortest paths, strongly polynomial time algorithm
File Description: 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
-
7
Authors: Nimrod Megiddo
Source: ORSA Journal on Computing. 3:63-65
Subject Terms: 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
File Description: application/xml
-
8
Authors: et al.
Contributors: et al.
Subject Terms: Submodular flow, Shortest paths, Strongly polynomial time algorithm
Relation: boreal:4059; http://hdl.handle.net/2078.1/4059
Availability: http://hdl.handle.net/2078.1/4059
-
9
Authors: Orlin, James B., 1953-.
Source: Operations Research. 41:338-350
Subject Terms: 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
File Description: application/xml
Access 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 -
10
Authors: Turner, Lara
Source: Algorithmic Operations Research; Vol. 6 No. 2 (2011); Pages 91 - 104 ; 1718-3235
Subject Terms: shortest path problem, universal objective function, resource constrained shortest path problem, strongly polynomial-time algorithm
File Description: application/pdf
-
11
Authors: Turner, Lara (Dipl.-Math.)
Subject Terms: Shortest path problem, strongly polynomial-time algorithm, resource constrained shortest path problem, ddc:510, universal objective function
File Description: application/pdf
-
12
Authors:
Contributors:
Subject Terms: 일반화된 네트워크, generalized network, 최단확산경로문제, shortest diffusion path problem, 강성다항식해법, diffusion inequalitied, 확산부등식, LI(2), 2항선형부등식, strongly polynomial time algorithm
File Description: v, 101 장
Relation: http://dcollection.snu.ac.kr:80/jsp/common/DcLoOrgPer.jsp?sItemId=000000082716; https://hdl.handle.net/10371/50606
-
13
Authors: Wang, Q.
Source: Przegląd Elektrotechniczny.
-
14
-
15
-
16
-
17
Full Text Finder 
Nájsť tento článok vo Web of Science