Výsledky vyhledávání - "Strongly-Polynomial Algorithm"

A Strongly-Polynomial Algorithm for General Linear Programming via Epochic Combinatorial Pivoting and Universal Shock Control ; Un algorithme fortement polynomial pour la programmation linéaire générale via pivot combinatoire par époques et contrôle universel de choc

Autoři: Vitali, Jerome

Témata: Linear Programming, Strongly-Polynomial Algorithm, Combinatorial Pivoting, Universal Shock Lemma, Epoch Law, Bit-Agnostic Optimization, Lexicographic Perturbation, Polynomial Pivot Bound, Hadamard Inequality, Deterministic Optimization, PN Algorithm

Relation: https://zenodo.org/communities/mathematics_numbers_theory/; https://zenodo.org/records/16932508; oai:zenodo.org:16932508; https://doi.org/10.5281/zenodo.16932508

Dostupnost: https://doi.org/10.5281/zenodo.16932508
https://zenodo.org/records/16932508

A Strongly-Polynomial Algorithm for General Linear Programming via Epochic Combinatorial Pivoting and Universal Shock Control

Autoři: Vitali, Jerome

Témata: Hadamard Inequality, Polynomial Pivot Bound, PN Algorithm, Lexicographic Perturbation, Universal Shock Lemma, Epoch Law, Linear Programming, Combinatorial Pivoting, Strongly-Polynomial Algorithm, Bit-Agnostic Optimization, Deterministic Optimization

A strongly polynomial algorithm for linear exchange markets

Autoři: Jugal Garg László A. Végh Charikar, Moses a další

Přispěvatelé: Jugal Garg László A. Végh Charikar, Moses a další

Zdroj: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing -STOC 2019
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing

Témata: 0211 other engineering and technologies, two-variable-per-inequality systems, 0102 computer and information sciences, 02 engineering and technology, Z+-Matrix, Strongly Polynomial Algorithm, 01 natural sciences, Linear Exchange Markets, Market Equilibria, strongly polynomial algorithm, Computer Science - Data Structures and Algorithms, optimization, linear exchange markets, market equilibria

Přístupová URL adresa: https://dl.acm.org/doi/pdf/10.1145/3313276.3316340
http://arxiv.org/abs/1809.06266
https://dblp.uni-trier.de/db/journals/corr/corr1809.html#abs-1809-06266
https://arxiv.org/abs/1809.06266
https://dl.acm.org/doi/10.1145/3313276.3316340
https://arxiv.org/pdf/1809.06266.pdf
https://eprints.lse.ac.uk/101048/
https://experts.illinois.edu/en/publications/a-strongly-polynomial-algorithm-for-linear-exchange-markets
http://eprints.lse.ac.uk/101048/
http://eprints.lse.ac.uk/113604/

An Accelerated Newton–Dinkelbach Method and Its Application to Two Variables per Inequality Systems

Autoři: Dadush, Daniel Koh, Zhuan Khye Natura, Bento a další

Zdroj: Mathematics of Operations Research

Témata: two variables per inequality system, parametric optimization, European Union's Horizon 2020 research and innovation programme (grant agreement nos. 757481–ScaleOpt and 805241–QIP, strongly polynomial algorithm, 0211 other engineering and technologies, submodular function minimization, 02 engineering and technology, fractional optimization, Newton–Dinkelbach method, Markov decision process

Přístupová URL adresa: http://eprints.lse.ac.uk/117202/

Cost Allocation for a Tree Network with Heterogeneous Customers

Autoři: Granot, Daniel Kuipers, Jeroen Chopra, Sunil

Zdroj: Mathematics of Operations Research, 2002 Nov 01. 27(4), 647-661.

Přístupová URL adresa: https://www.jstor.org/stable/3690459

Rounding of Polytopes in the Real Number Model of Computation

Autoři: Khachiyan, Leonid G.

Zdroj: Mathematics of Operations Research, 1996 May 01. 21(2), 307-320.

Přístupová URL adresa: https://www.jstor.org/stable/3690235

A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE

Autoři: Liu, L. C. Yao, E. Y.

Zdroj: Asia-Pacific Journal of Operational Research. 24:725-736

Témata: minimum cut, hamming distance, strongly polynomial algorithm, 0211 other engineering and technologies, inverse problem, Minimum cut, inverse problem, hamming distance, strongly polynomial algorithm, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: https://ideas.repec.org/a/wsi/apjorx/v24y2007i05ns0217595907001474.html
https://dblp.uni-trier.de/db/journals/apjor/apjor24.html#LiuY07
http://dspace.xmu.edu.cn/handle/2288/70642?show=full
https://www.worldscientific.com/doi/abs/10.1142/S0217595907001474
http://www.worldscinet.com/cgi-bin/details.cgi?type=pdf&id=pii:S0217595907001474
http://www.worldscinet.com/cgi-bin/details.cgi?type=html&id=pii:S0217595907001474

Integer version of the multipath flow network synthesis problem

Autoři: Ramaswamy Chandrasekaran K. P. K. Nair Yash P. Aneja a další

Zdroj: Discrete Applied Mathematics. 156:3376-3399

Témata: Multipath flows, Strongly polynomial algorithm, Applied Mathematics, 0211 other engineering and technologies, Combinatorial algorithm, Discrete Mathematics and Combinatorics, 0102 computer and information sciences, 02 engineering and technology, Networks, 01 natural sciences, Network synthesis

Přístupová URL adresa: https://core.ac.uk/display/82044788
https://dblp.uni-trier.de/db/journals/dam/dam156.html#KabadiCNA08
http://dblp.uni-trier.de/db/journals/dam/dam156.html#KabadiCNA08
https://www.sciencedirect.com/science/article/abs/pii/S0166218X08000322
https://www.sciencedirect.com/science/article/pii/S0166218X08000322

A strongly polynomial algorithm for solving two-sided linear systems in max-algebra

Autoři: Peter Butkovič Karel Zimmermann

Zdroj: Discrete Applied Mathematics. 154:437-446

Témata: Strongly polynomial algorithm, Applied Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Discrete Mathematics and Combinatorics, Max-algebra, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Two-sided equation

Weighted Inverse Minimum Spanning Tree Problems Under Hamming Distance: Weighted inverse minimum spanning tree problems under Hamming distance

Autoři: Enyu Yao Binwu Zhang Yong He

Zdroj: Journal of Combinatorial Optimization. 9:91-100

Témata: Combinatorial optimization, strongly polynomial algorithm, 0211 other engineering and technologies, inverse problem, 0102 computer and information sciences, 02 engineering and technology, minimum spanning tree, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/2168268
https://doi.org/10.1007/s10878-005-5486-1

Multi-terminal multipath flows: synthesis

Autoři: Santosh N. Kabadi K. P. K. Nair Y. P. Aneja a další

Zdroj: Discrete Applied Mathematics. 143:182-193

Témata: Applied Mathematics, 0211 other engineering and technologies, Directed graphs (digraphs), tournaments, 0102 computer and information sciences, 02 engineering and technology, Programming involving graphs or networks, 01 natural sciences, Multipath flows, Graph algorithms (graph-theoretic aspects), Graph theory (including graph drawing) in computer science, Strongly polynomial algorithm, Deterministic network models in operations research, \(q\)-capacity of a cut, Discrete Mathematics and Combinatorics, q-capacity of a cut, Network synthesis

Popis souboru: application/xml

Přístupová URL adresa: https://core.ac.uk/display/82365105
https://dblp.uni-trier.de/db/journals/dam/dam143.html#ChandrasekaranNAK04
https://www.sciencedirect.com/science/article/pii/S0166218X04001295
https://www.sciencedirect.com/science/article/abs/pii/S0166218X04001295

On Inverse Problems of Optimum Perfect Matching: On inverse problems of optimum perfect matching

Autoři: Jianzhong Zhang Zhenhong Liu

Zdroj: Journal of Combinatorial Optimization. 7:215-228

Témata: ellipsoid method, Linear programming, maximum-weight matching, perfect matching, strongly polynomial algorithm, Deterministic network models in operations research, maximum-mean alternating cycle, 0211 other engineering and technologies, linear programming, 02 engineering and technology, 0101 mathematics, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://link.springer.com/article/10.1023%2FA%3A1027305419461
https://dblp.uni-trier.de/db/journals/jco/jco7.html#LiuZ03

Cost Allocation for a Tree Network with Heterogeneous Customers: Cost allocation for a tree network with heterogeneous customers.

Autoři: Sunil Chopra Jeroen Kuipers Daniel Granot

Zdroj: Mathematics of Operations Research. 27:647-661

Témata: SPANNING TREE, FLOW GAMES, 05 social sciences, 0211 other engineering and technologies, 02 engineering and technology, facets, Resource and cost allocation (including fair division, apportionment, etc.), TOTALLY BALANCED GAMES, NUCLEOLUS, Cooperative games, polytope, strongly polynomial algorithm, 0502 economics and business, Deterministic network models in operations research, polytope, facets, CORE, Shapley value, cooperative game, Games involving graphs, nucleolus, convex game

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/2228266
https://doi.org/10.1287/moor.27.4.647.307
https://pubsonline.informs.org/doi/10.1287/moor.27.4.647.307
https://doi.org/10.1287/moor.27.4.647.307
https://dblp.uni-trier.de/db/journals/mor/mor27.html#GranotKC02
https://cris.maastrichtuniversity.nl/en/publications/cost-allocation-for-a-tree-network-with-heterogeneous-customers
https://www.scholars.northwestern.edu/en/publications/cost-allocation-for-a-tree-network-with-heterogeneous-customers
https://www.narcis.nl/publication/RecordID/oai%3Acris.maastrichtuniversity.nl%3Apublications%2Ffa8dd6d5-7a64-4b45-8a75-4fb66b77b8ab

On dual minimum cost flow algorithms

Autoři: Jens Vygen

Zdroj: Mathematical Methods of Operations Research (ZOR). 56:101-126

Témata: Graph algorithms (graph-theoretic aspects), strongly polynomial algorithm, Deterministic network models in operations research, 0211 other engineering and technologies, Directed graphs (digraphs), tournaments, minimum cost flow problem, dual algorithms, 0102 computer and information sciences, 02 engineering and technology, Programming involving graphs or networks, cut cancelling, dual network simplex, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://EconPapers.repec.org/RePEc:spr:mathme:v:56:y:2002:i:1:p:101-126
https://link.springer.com/article/10.1007/s001860200202
https://doi.org/10.1007/s001860200202
https://ideas.repec.org/a/spr/mathme/v56y2002i1p101-126.html
https://dblp.uni-trier.de/db/journals/mmor/mmor56.html#Vygen02

Bottleneck Capacity Expansion Problems with General Budget Constraints: Bottleneck capacity expansion problems with general budget constraints

Autoři: Rainer E. Burkard Jianzhong Zhang Bettina Klinz

Zdroj: RAIRO - Operations Research. 35:1-20

Témata: Sensitivity, stability, parametric optimization, strongly polynomial algorithm, Polyhedral combinatorics, branch-and-bound, branch-and-cut, algebraic optimization, 0211 other engineering and technologies, bottleneck problem, 0102 computer and information sciences, 02 engineering and technology, Fractional programming, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: http://www.numdam.org/item/RO_2001__35_1_1_0.pdf
https://zbmath.org/1694884
https://doi.org/10.1051/ro:2001100

Inverse Problems of Matroid Intersection: Inverse problems of matroid intersection

Autoři: Cai Mao-cheng

Zdroj: Journal of Combinatorial Optimization. 3:465-474

Témata: Combinatorial optimization, minimum cost circulation, strongly polynomial algorithm, 0211 other engineering and technologies, inverse problem, matroid intersection, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/jco/jco3.html#Cai99
https://link.springer.com/article/10.1023/A:1009883605691

Exact solution of the SONET Ring Loading Problem: Exact solution of the SONET ring loading problem

Autoři: DELL'AMICO, Mauro MAFFIOLI F. LABBE' M. a další

Přispěvatelé: DELL'AMICO, Mauro MAFFIOLI F. LABBE' M. a další

Zdroj: Operations Research Letters, 25

Témata: 0211 other engineering and technologies, Integer programming, 02 engineering and technology, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], Communications. Programming, linear: algorithms, Programming, integer: branch-and-bound, branch and bound, Communication networks in operations research, strongly polynomial algorithm, Polyhedral combinatorics, branch-and-bound, branch-and-cut, synchronous optical networks, 0202 electrical engineering, electronic engineering, information engineering, Recherche opérationnelle, integer programming, linear algorithm

Popis souboru: application/xml; 1 full-text file(s): application/pdf

Přístupová URL adresa: https://hal.science/hal-01255618v1
https://zbmath.org/1396359
https://doi.org/10.1016/s0167-6377(99)00031-0
https://hal.archives-ouvertes.fr/hal-01255618
https://difusion.ulb.ac.be/vufind/Record/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/10591/Details
https://re.public.polimi.it/handle/11311/525297
https://iris.unimore.it/handle/11380/451183
https://dblp.uni-trier.de/db/journals/orl/orl25.html#DellAmicoLM99
https://www.sciencedirect.com/science/article/pii/S0167637799000310
http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/10591
https://hdl.handle.net/11380/451183
https://hdl.handle.net/11311/525297

Inverse Polymatroidal Flow Problem: Inverse polymatroidal flow problem

Autoři: Mao-cheng Cai Xiaoguang Yang Yanjun Li

Zdroj: Journal of Combinatorial Optimization. 3:115-126

Témata: combinatorial strongly polynomial algorithm, minimum cost circulation, 0211 other engineering and technologies, inverse problem, polymatroidal flow, 0102 computer and information sciences, 02 engineering and technology, Programming involving graphs or networks, Combinatorial aspects of matroids and geometric lattices, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1339732
https://doi.org/10.1023/a:1009877408258
https://link.springer.com/content/pdf/10.1023/A:1009877408258.pdf
https://link.springer.com/article/10.1023/A%3A1009877408258
https://dblp.uni-trier.de/db/journals/jco/jco3.html#CaiYL99

Balanced network flows. III. Strongly polynomial augmentation algorithms: Balanced network flows. III: Strongly polynomial augmentation algorithms

Autoři: Fremuth-Paeger, Christian Jungnickel, Dieter

Zdroj: Networks. 33:43-56

Témata: balanced flow networks, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), network flows, matching problems, strongly polynomial algorithm, Deterministic network models in operations research, augmenting paths, Programming involving graphs or networks

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1769332
https://doi.org/10.1002/(sici)1097-0037(199901)33:1<43::aid-net3>3.0.co;2-6
https://dblp.uni-trier.de/db/journals/networks/networks33.html#Fremuth-PaegerJ99b
https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/44636

On the inverse problem of linear programming and its application to minimum weight perfect k-matching: On the inverse problem of linear programming and its application to minimum weight perfect \(k\)-matching

Autoři: Siming Huang Zhenhong Liu

Zdroj: European Journal of Operational Research. 112:421-426

Témata: Combinatorial optimization, Linear programming, bipartite graph, strongly polynomial algorithm, 0211 other engineering and technologies, inverse problem, linear programming, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://econpapers.repec.org/article/eeeejores/v_3a112_3ay_3a1999_3ai_3a2_3ap_3a421-426.htm
https://ideas.repec.org/a/eee/ejores/v112y1999i2p421-426.html
http://www.sciencedirect.com/science/article/pii/S037722179700444X
https://www.sciencedirect.com/science/article/pii/S037722179700444X
https://dblp.uni-trier.de/db/journals/eor/eor112.html#HuangL99
https://doi.org/10.1016/S0377-2217(97)00444-X