Suchergebnisse - combinatorial strongly polynomial algorithm

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

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

Quelle: SIAM Journal on Computing. 49(1)

Schlagwörter: 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

Zugangs-URL: https://escholarship.org/uc/item/1c97d268

Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization

Autoren: Satoru Fujishige S. Thomas McCormick

Quelle: Mathematical Programming. 122:87-120

Schlagwörter: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Zugangs-URL: https://link.springer.com/article/10.1007%2Fs10107-008-0242-9
https://dblp.uni-trier.de/db/conf/soda/soda2008.html#McCormickF08
https://core.ac.uk/display/101050839
http://www.kurims.kyoto-u.ac.jp/preprint/file/RIMS1603.pdf
https://www.kurims.kyoto-u.ac.jp/preprint/file/RIMS1603.pdf
https://link.springer.com/content/pdf/10.1007%2Fs10107-008-0242-9.pdf

A combinatorial strongly polynomial algorithm for minimizing submodular functions

Autoren: Satoru Iwata Lisa Fleischer Satoru Fujishige

Quelle: Journal of the ACM. 48:761-777

Schlagwörter: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Zugangs-URL: http://core.ac.uk/display/20976063
https://dl.acm.org/doi/10.1145/502090.502096
https://doi.org/10.1145/502090.502096
https://dblp.uni-trier.de/db/journals/jacm/jacm48.html#IwataFF01

A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems: A strongly polynomial algorithm for minimum cost submodular flow problems

Autoren: Satoru Fujishige Hans Röck Uwe Zimmermann

Quelle: Mathematics of Operations Research. 14:60-69

Schlagwörter: minimum cost submodular flow, Analysis of algorithms and problem complexity, scaling, Deterministic network models in operations research, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Programming involving graphs or networks, tree projection, purely combinatorial strongly polynomial algorithm, 01 natural sciences

Dateibeschreibung: application/xml

Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization.

Autoren: McCormick, S. Thomas Fujishige, Satoru

Quelle: Mathematical Programming; Mar2010, Vol. 122 Issue 1, p87-120, 34p, 3 Diagrams

Schlagwörter: MODULAR functions, POLYNOMIALS, ALGORITHMS, COMBINATORIAL optimization, COMBINATORICS, MATHEMATICAL optimization

Strongly Polynomial and Fully Combinatorial Algorithms for Bisubmodular Function Minimization

Autoren: S. Thomas McCormick Satoru Fujishige The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: S. Thomas McCormick Satoru Fujishige The Pennsylvania State University CiteSeerX Archives

Quelle: http://people.commerce.ubc.ca/faculty/mccormick/bsfm9.pdf.

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.522.5003; http://people.commerce.ubc.ca/faculty/mccormick/bsfm9.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.522.5003
http://people.commerce.ubc.ca/faculty/mccormick/bsfm9.pdf

Strongly Polynomial and Fully Combinatorial Algorithms for Bisubmodular Function Minimization

Autoren: S. Thomas McCormick Satoru Fujishige The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: S. Thomas McCormick Satoru Fujishige The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.kurims.kyoto-u.ac.jp/preprint/file/RIMS1603.pdf.

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.95.8022

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.95.8022
http://www.kurims.kyoto-u.ac.jp/preprint/file/RIMS1603.pdf

A Combinatorial Strongly Polynomial Algorithm for Minimizing Submodular Functions.

Autoren: Iwata, Satoru Fleischer, Lisa Fujishige, Satoru

Quelle: Journal of the ACM; Jul2001, Vol. 48 Issue 4, p761, 17p, 3 Charts

Schlagwörter: ALGORITHMS, SUBMODULAR functions

Widest Path in Networks with Gains/Losses

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

Quelle: Axioms, Vol 13, Iss 2, p 127 (2024)

Schlagwörter: combinatorial optimization, widest path, maximum capacity path, strongly polynomial algorithms, GPU parallelization, Mathematics, QA1-939

Dateibeschreibung: electronic resource

Relation: https://www.mdpi.com/2075-1680/13/2/127; https://doaj.org/toc/2075-1680

Zugangs-URL: https://doaj.org/article/e0b2ddfe877949acad1dbc4f1471292d

A Combinatorial Strongly Polynomial Algorithm for Minimizing Submodular Functions

Autoren: Satoru IWATA Lisa FLEISCHER Satoru FUJISHIGE et al.

Weitere Verfasser: Satoru IWATA Lisa FLEISCHER Satoru FUJISHIGE et al.

Quelle: http://www.aladdin.cs.cmu.edu/papers/pdfs/y2000/sfm.pdf.

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.9973; http://www.aladdin.cs.cmu.edu/papers/pdfs/y2000/sfm.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.9973
http://www.aladdin.cs.cmu.edu/papers/pdfs/y2000/sfm.pdf

A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems

Autoren: Fujishige, Satoru Röck, Hans Zimmermann, Uwe

Quelle: Mathematics of Operations Research, 1989 Feb 01. 14(1), 60-69.

Zugangs-URL: https://www.jstor.org/stable/3689837

A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables

Autoren: Tuy, Hoàng Ghannadan, Saied Migdalas, Athanasios et al.

Quelle: Mathematical programming. 72(3):229-258

Schlagwörter: Industriell logistik, Industrial Logistics

Dateibeschreibung: print

Zugangs-URL: https://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-12432

Strongly polynomial algorithm for a production-transportation problem with concave production cost

Autoren: Tuy, Hoang Ghannadan, Saied Migdalas, Athanasios et al.

Quelle: Optimization. 27(3):205-227

Schlagwörter: Industriell logistik, Industrial Logistics

Dateibeschreibung: print

Zugangs-URL: https://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-3591

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

A combinatorial strongly polynomial algorithm for minimizing submodular functions

Autoren: Satoru Fujishige The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Satoru Fujishige The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.osaka-u.ac.jp/eng/research/annualreport/vol2/selection/pdf/paper04a.pdf.

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.8950

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.8950
http://www.osaka-u.ac.jp/eng/research/annualreport/vol2/selection/pdf/paper04a.pdf

Inverse Polymatroidal Flow Problem: Inverse polymatroidal flow problem

Autoren: Mao-cheng Cai Xiaoguang Yang Yanjun Li

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

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-URL: 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

A strongly polynomial algorithm for line search in submodular polyhedra

Autoren: Nagano, Kiyohito¹ kiyohito_nagano@mist.i.u-tokyo.ac.jp

Quelle: Discrete Optimization. Dec2007, Vol. 4 Issue 3/4, p349-359. 11p.

Schlagwörter: Matroids, Submodular functions, Solid geometry, Cubes

A new model for multicommodity flow problems, and a strongly polynomial algorithm for single-source Maximum Concurrent Flow.

Autoren: Bauguion, Pierre-Olivier Ben-Ameur, Walid Gourdin, Eric

Quelle: Electronic Notes in Discrete Mathematics. Jun2013, Vol. 41, p311-318. 8p.

An efficient algorithm for packing cuts and (2,3)-metrics in a planar graph with three holes.

Autoren: Karzanov, Alexander V.¹ (AUTHOR) akarzanov7@gmail.com

Quelle: Discrete Optimization. Aug2019, Vol. 33, p118-139. 22p.

Schlagwörter: Planar graphs, Algorithms, Integers

Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants

Autoren: Björklund, Andreas Kaski, Petteri Williams, Ryan et al.

Weitere Verfasser: Björklund, Andreas Kaski, Petteri Williams, Ryan et al.

Quelle: Algorithmica. 81(10):4010-4028

Schlagwörter: Natural Sciences, Computer and Information Sciences, Computer Sciences, Naturvetenskap, Data- och informationsvetenskap (Datateknik), Datavetenskap (Datalogi)

Zugangs-URL: https://doi.org/10.1007/s00453-018-0513-7