Výsledky vyhľadávania - "Strongly polynomial-time algorithms"

About strongly polynomial time algorithms for quadratic optimization over submodular constraints

Autori: Dorit S. Hochbaum Sung-Pil Hong

Zdroj: Mathematical Programming. 69:269-309

Predmety: parametric maximum flow, Linear programming, Special polytopes (linear programming, centrally symmetric, etc.), 0211 other engineering and technologies, Integer programming, strongly polynomial algorithms, 02 engineering and technology, Quadratic programming, Programming involving graphs or networks, convex separable quadratic minimization over submodular constraints, Abstract computational complexity for mathematical programming problems, lexicographically optimal flow, Kuhn-Tucker conditions

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/849128
https://link.springer.com/article/10.1007%2FBF01585561
https://dl.acm.org/doi/10.5555/216227.216233
https://s-space.snu.ac.kr/handle/10371/5329
https://dblp.uni-trier.de/db/journals/mp/mp69.html#HochbaumH95

Strongly polynomial time algorithms for certain concave minimization problems on networks

Autori: Nguyen Dinh Dan Saied Ghannadan Hoang Tuy

Zdroj: Operations Research Letters. 14:99-109

Predmety: single source uncapacitated network, production- transportation problem, minimum concave cost flow problem, parametric method, Sensitivity, stability, parametric optimization, strongly polynomial algorithm, Deterministic network models in operations research, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Production models, Abstract computational complexity for mathematical programming problems, 01 natural sciences

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/527400
https://doi.org/10.1016/0167-6377(93)90102-m
https://dblp.uni-trier.de/db/journals/orl/orl14.html#TuyDG93
https://www.sciencedirect.com/science/article/pii/016763779390102M
http://www.sciencedirect.com/science/article/pii/016763779390102M

The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential

Autori: De Loera, Jesús A Haddock, Jamie Rademacher, Luis

Zdroj: SIAM Journal on Computing. 49(1)

Predmety: Applied Mathematics, Numerical and Computational Mathematics, Pure Mathematics, Mathematical Sciences, convex quadratic optimization, Wolfe's method, linear programming, strongly polynomial time algorithms, lower bounds, Computation Theory and Mathematics, Computation Theory & Mathematics, Theory of computation, Applied mathematics, Numerical and computational mathematics

Prístupová URL adresa: https://escholarship.org/uc/item/1c97d268

The minimum Euclidean-norm point in a convex polytope: Wolfe's combinatorial algorithm is exponential

Autori: Jesús A. De Loera Jamie Haddock Luis Rademacher

Zdroj: SIAM Journal on Computing, vol 49, iss 1

Predmety: FOS: Computer and information sciences, Numerical and Computational Mathematics, Numerical and computational mathematics, Applied Mathematics, convex quadratic optimization, Wolfe's method, strongly polynomial time algorithms, 0211 other engineering and technologies, linear programming, Computation Theory and Mathematics, Metric Geometry (math.MG), 02 engineering and technology, Applied mathematics, Pure Mathematics, Mathematical Sciences, Computation Theory & Mathematics, lower bounds, Mathematics - Metric Geometry, Optimization and Control (math.OC), Computer Science - Data Structures and Algorithms, FOS: Mathematics, Data Structures and Algorithms (cs.DS), 90C20, 90C27, 90C60, Mathematics - Optimization and Control, Theory of computation

Prístupová URL adresa: https://dl.acm.org/doi/pdf/10.1145/3188745.3188820
http://arxiv.org/pdf/1710.02608
http://arxiv.org/abs/1710.02608
https://arxiv.org/abs/1710.02608
https://dblp.uni-trier.de/db/journals/corr/corr1710.html#abs-1710-02608
https://dl.acm.org/doi/pdf/10.1145/3188745.3188820
https://epubs.siam.org/doi/abs/10.1137/18M1221072
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp49.html#LoeraHR20
https://escholarship.org/uc/item/1c97d268

About strongly polynomial time algorithms for quadratic optimization over submodular constraints.

Autori: Hochbaum, Dorit Hong, Sung-Pil

Zdroj: Mathematical Programming; Jul1995, Vol. 69 Issue 1-3, p269-309, 41p

ReLU neural networks of polynomial size for exact maximum flow computation: Poly-size ReLU neural networks for maximum flow computation: C. Hertrich, L. Sering.

Autori: Hertrich, Christoph Sering, Leon

Zdroj: Mathematical Programming; Mar2025, Vol. 210 Issue 1, p377-406, 30p

Predmety: POLYNOMIAL time algorithms, UNDIRECTED graphs, ARTIFICIAL neural networks, TREE graphs, AFFINE transformations

Hypergraph Connectivity Augmentation in Strongly Polynomial Time

Autori: Bérczi, Kristóf Chandrasekaran, Karthekeyan Király, Tamás a ďalší

Témy: Computer Science - Data Structures and Algorithms, Computer Science - Discrete Mathematics, text

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

Some robust inverse median problems on trees with interval costs.

Autori: Dai, Le Xuan Nguyen, Kien Trung Thao, Le Phuong a ďalší

Zdroj: Computational Management Science; 9/20/2024, Vol. 21 Issue 2, p1-25, 25p

Predmety: POLYNOMIAL time algorithms, HAMMING distance, INVERSE problems, ROBUST optimization, COST functions

Minimizing the expense transmission time from the source node to demand nodes.

Autori: Ghiyasvand, Mehdi Keshtkar, Iman

Zdroj: Journal of Combinatorial Optimization; Apr2024, Vol. 47 Issue 3, p1-18, 18p

Better and Simpler Reducibility Bounds over the Integers

Autori: Levin, Asaf

Témy: Mathematics - Optimization and Control, Computer Science - Discrete Mathematics, Computer Science - Data Structures and Algorithms, 90C10, text

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

Widest Path in Networks with Gains/Losses.

Autori: Tayyebi, Javad Rîtan, Mihai-Lucian Deaconu, Adrian Marius

Zdroj: Axioms (2075-1680); Feb2024, Vol. 13 Issue 2, p127, 16p

Predmety: COMBINATORIAL optimization

A Weighted Inverse Minimum s−t Cut Problem with Value Constraint Under the Bottleneck-Type Hamming Distance.

Autori: Ghalebala, Elham Ramzani Aman, Massoud Nasrabadi, Nasim

Zdroj: Asia-Pacific Journal of Operational Research; Feb2024, Vol. 41 Issue 1, p1-22, 22p

Predmety: HAMMING distance, CUTTING stock problem, POLYNOMIAL time algorithms, HAMMING weight, INVERSE problems

On a Deterministic Property of the Category of k-almost Primes: A Deterministic Structure Based on a Linear Function for Redefining the k-almost Primes (∃n∈N, 1≤k≤n) in Certain Intervals

Autori: Zahedi, Ramin

Predmety: Deterministic Structure of k-almost Prime Numbers, Strongly Polynomial Time Algorithms, Prime Numbers' Algebraic Re-Definition (Algebraic Reproduction), Factorization

Time: 410

Relation: http://hdl.handle.net/2115/62699

Dostupnosť: http://hdl.handle.net/2115/62699

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time.

Autori: Chen, Li Kyng, Rasmus Liu, Yang a ďalší

Zdroj: Journal of the ACM; Jun2025, Vol. 72 Issue 3, p1-103, 103p

Predmety: DIRECTED acyclic graphs, DATA structures, INTERIOR-point methods, ISOTONIC regression, FLOWGRAPHS

From Incremental Transitive Cover to Strongly Polynomial Maximum Flow

Autori: Dadush, Daniel Orlin, James B. Sidford, Aaron a ďalší

Predmety: Data Structures and Algorithms

Relation: http://arxiv.org/abs/2510.20368

Dostupnosť: http://arxiv.org/abs/2510.20368

Partial inverse maximum spanning tree problem under the Chebyshev norm.

Autori: Li, Xianyue Yang, Ruowang Zhang, Heping a ďalší

Zdroj: Journal of Combinatorial Optimization; Dec2022, Vol. 44 Issue 5, p3331-3350, 20p

Dynamic network flow location models and algorithms for quickest evacuation planning.

Autori: Nath, Hari Nandan Pyakurel, Urmila Dhamala, Tanka Nath a ďalší

Zdroj: Journal of Industrial & Management Optimization; Sep2021, Vol. 17 Issue 5, p2943-2970, 28p

Predmety: CIVILIAN evacuation, POLYNOMIAL time algorithms, TRAFFIC flow, INTEGER programming, ALGORITHMS, NP-hard problems

Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance.

Autori: Pham, Van Huy Nguyen, Kien Trung Le, Tran Thu

Zdroj: Optimization Methods & Software; Aug2021, Vol. 36 Issue 4, p755-772, 18p

Predmety: HAMMING distance, POLYNOMIAL time algorithms, INVERSE problems

Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance.

Autori: Wang, Hui Guan, Xiucui Zhang, Qiao a ďalší

Zdroj: Journal of Combinatorial Optimization; May2021, Vol. 41 Issue 4, p861-887, 27p

Network Reconfiguration with Orientation-Dependent Transit Times.

Autori: Nath, Hari Nandan Pyakurel, Urmila Dhamala, Tanka Nath

Zdroj: International Journal of Mathematics & Mathematical Sciences; 3/11/2021, p1-11, 11p

Predmety: POLYNOMIAL time algorithms, CIVILIAN evacuation, TIME

Geografický termín: KATHMANDU (Nepal)