Search Results - "Strongly polynomial time algorithm"

A compact implementation of a recently proposed strongly polynomial-time algorithm for the general LP problem

Authors: Awoniyi, Samuel

Subject Terms: Optimization and Control (math.OC), Optimization and Control, FOS: Mathematics, Math OC

Access URL: http://arxiv.org/abs/2505.01426

A strongly polynomial-time algorithm for the general linear programming problem

Authors: Awoniyi, Samuel

Subject Terms: Optimization and Control (math.OC), Optimization and Control, FOS: Mathematics, Math OC

Access URL: http://arxiv.org/abs/2503.12041

A Strongly Polynomial-Time Algorithm forWeighted General Factors with Three Feasible Degrees*

Authors: Shao, Shuai Živný, Stanislav Shuai Shao and Stanislav Živný

Contributors: Shao, Shuai Živný, Stanislav Shuai Shao and Stanislav Živný

Subject Terms: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 4. Education, factors, delta matroids, terminal backup problem, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, 7. Clean energy, edge constraint satisfaction problems, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, matchings, 0101 mathematics, Computer Science - Discrete Mathematics

File Description: application/pdf

Access URL: http://arxiv.org/abs/2301.11761
https://ora.ox.ac.uk/objects/uuid:d361f53b-e2ce-4800-9f85-1f6e0c0ba1ed
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.57

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

Authors: Akira Nakayama Tsutomu Anazawa Yudai Iwaki

Source: Journal of the Operations Research Society of Japan. 65:23-47

Subject Terms: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Access URL: https://www.jstage.jst.go.jp/article/jorsj/65/1/65_23/_pdf

Tri-skill variant Simplex and strongly polynomial-time algorithm for linear programming

Authors: Wang Pei-zhuang He Jing Kong Qi-wei et al.

Source: IEEE/WIC/ACM International Conference on Web Intelligence. :257-261

Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, 0101 mathematics, 01 natural sciences

A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees

Authors: Shao, Shuai Živný, Stanislav

Index Terms: Computer Science - Discrete Mathematics, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/2301.11761

Validation of a strongly polynomial-time algorithm for the general linear programming problem

Authors: Awoniyi, Samuel

Subject Terms: 90C05, Optimization and Control (math.OC), FOS: Mathematics, Mathematics - Optimization and Control

Access URL: http://arxiv.org/abs/2310.05855

A numerical illustration of a recently proposed strongly polynomial-time algorithm for the general linear programming problem

Authors: Awoniyi, Samuel

Subject Terms: Optimization and Control (math.OC), FOS: Mathematics, Mathematics - Optimization and Control

Access URL: http://arxiv.org/abs/2309.01037

A Strongly Polynomial Time Algorithm for the Maximum Supply Rate Problem on Trees

Authors: Koki Takayama Yusuke Kobayashi

Source: Lecture Notes in Computer Science ISBN: 9783319784540

Subject Terms: 8. Economic growth, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 7. Clean energy

Access URL: https://www.sciencedirect.com/science/article/am/pii/S0304397519303226
https://www.sciencedirect.com/science/article/abs/pii/S0304397519303226
https://dblp.uni-trier.de/db/journals/tcs/tcs806.html#TakayamaK20
https://dblp.uni-trier.de/db/conf/faw/faw2018.html#TakayamaK18
https://link.springer.com/chapter/10.1007/978-3-319-78455-7_5
https://rd.springer.com/chapter/10.1007/978-3-319-78455-7_5

A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees

Authors: Shuai Shao and Stanislav Živný Shao, Shuai Živný, Stanislav

Index Terms: matchings, factors, edge constraint satisfaction problems, terminal backup problem, delta matroids, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.57
Is Part Of LIPIcs, Volume 283, 34th International Symposium on Algorithms and Computation (ISAAC 2023)

Tri-skill variant Simplex and strongly polynomial-time algorithm for linear programming

Authors: Wang, P. Z. He, J. Lui, H. C. et al.

Subject Terms: Optimization and Control (math.OC), FOS: Mathematics, Mathematics - Optimization and Control

Access URL: http://arxiv.org/abs/2101.02996

A faster strongly polynomial time algorithm to solve the minimum cost tension problem

Authors: Mehdi Ghiyasvand

Source: Journal of Combinatorial Optimization. 34:203-217

Subject Terms: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Access URL: https://link.springer.com/article/10.1007/s10878-016-0070-4/fulltext.html
https://link.springer.com/article/10.1007%2Fs10878-016-0070-4
https://dblp.uni-trier.de/db/journals/jco/jco34.html#Ghiyasvand17

A strongly polynomial-time algorithm for weighted general factors with three feasible degrees

Authors: Shao, S Zivny, S

Availability: https://ora.ox.ac.uk/objects/uuid:d361f53b-e2ce-4800-9f85-1f6e0c0ba1ed

A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem

Authors: Paulo Roberto Oliveira

Source: Mathematical Methods of Operations Research. 80:267-284

Subject Terms: 13. Climate action, 0211 other engineering and technologies, 02 engineering and technology

Access URL: https://link.springer.com/article/10.1007/s00186-014-0480-y
https://econpapers.repec.org/article/sprmathme/v_3a80_3ay_3a2014_3ai_3a3_3ap_3a267-284.htm
https://link.springer.com/content/pdf/10.1007%2Fs00186-014-0480-y.pdf
https://ideas.repec.org/a/spr/mathme/v80y2014i3p267-284.html

A faster strongly polynomial time algorithm for submodular function minimization

Authors: James B. Orlin

Source: Lecture Notes in Computer Science ISBN: 9783540727910

Subject Terms: 4. Education, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 7. Clean energy, 01 natural sciences

Access URL: https://dblp.uni-trier.de/db/conf/ipco/ipco2007.html#Orlin07
https://rd.springer.com/chapter/10.1007/978-3-540-72792-7_19
https://link.springer.com/chapter/10.1007%2F978-3-540-72792-7_19
https://link.springer.com/content/pdf/10.1007%2F978-3-540-72792-7_19.pdf

Strongly polynomial-time algorithm for over-constraint resolution: efficient debugging of timing constraint violations: efficient debugging of timing constraint violations

Authors: Ali Dasdan

Source: Proceedings of the Tenth International Symposium on Hardware/Software Codesign. CODES 2002 (IEEE Cat. No.02TH8627). :127-132

Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 7. Clean energy

Access URL: https://dblp.uni-trier.de/db/conf/codes/codes2002.html#Dasdan02
https://ieeexplore.ieee.org/document/1003613/
https://doi.org/10.1145/774789.774816
http://portal.acm.org/citation.cfm?doid=774789.774816
https://dl.acm.org/doi/10.1145/774789.774816

A strongly polynomial time algorithm for a constrained submodular optimization problem

Authors: David Hartvigsen

Source: Discrete Applied Mathematics. 113:183-194

Subject Terms: Combinatorial optimization, Analysis of algorithms and problem complexity, Applied Mathematics, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Programming involving graphs or networks, 01 natural sciences, Max flow, Min cost spanning tree, Base polyhedron, Discrete Mathematics and Combinatorics, Submodular function, Abstract computational complexity for mathematical programming problems

File Description: application/xml

Access URL: https://zbmath.org/1687488
https://doi.org/10.1016/s0166-218x(00)00285-7
https://dblp.uni-trier.de/db/journals/dam/dam113.html#Hartvigsen01
https://www.sciencedirect.com/science/article/pii/S0166218X00002857
https://www.sciencedirect.com/science/article/abs/pii/S0166218X00002857

A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions

Authors: Lisa Fleischer Satoru Iwata Satoru Fujishige

Source: Proceedings of the thirty-second annual ACM symposium on Theory of computing. :97-106

Subject Terms: FOS: Mathematics, 0211 other engineering and technologies, Mathematics - Combinatorics, Combinatorics (math.CO), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Access URL: http://arxiv.org/pdf/math/0004089
http://arxiv.org/abs/math/0004089
https://www.opt.mist.i.u-tokyo.ac.jp/~iwata/papers/sfm.pdf
https://dblp.uni-trier.de/db/conf/stoc/stoc2000.html#IwataFF00
http://www.cs.dartmouth.edu/~lkf/papers/sfm.pdf
https://core.ac.uk/display/21438296
https://dl.acm.org/doi/10.1145/335305.335317
http://www.opt.mist.i.u-tokyo.ac.jp/~iwata/papers/sfm.pdf

A Strongly Polynomial Time Algorithm for the Shortest Path Problem on Coherent Planar Periodic Graphs

Authors: Norie Fu

Source: Lecture Notes in Computer Science ISBN: 9783642352607

Access URL: https://link.springer.com/content/pdf/10.1007%2F978-3-642-35261-4_42.pdf
https://link.springer.com/chapter/10.1007/978-3-642-35261-4_42
https://rd.springer.com/chapter/10.1007/978-3-642-35261-4_42
https://dblp.uni-trier.de/db/conf/isaac/isaac2012.html#Fu12

A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts

Authors: Maurice Queyranne S. Thomas McCormick Hassene Aissi et al.

Source: Lecture Notes in Computer Science ISBN: 9783319075563

Subject Terms: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences