Suchergebnisse - "combinatorial strongly polynomial algorithm"

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 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 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

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 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

Practical algorithm for minimum cost submodular cover problem with performance guarantees.

Autoren: Pham, Canh V. Tran, Tan D. Ha, Dung T. K. et al.

Quelle: Optimization Letters; Dec2025, Vol. 19 Issue 9, p1929-1952, 24p

Optimizing the Trade-off Between Batching and Waiting: Subadditive Dispatching.

Autoren: Erazo, Ignacio Toriello, Alejandro

Quelle: Operations Research; Nov/Dec2025, Vol. 73 Issue 6, p3359-3388, 30p

Schlagwörter: LOGISTICS, BATCH processing, ELECTRONIC commerce, MATHEMATICAL optimization, NP-hard problems, FLEXIBLE manufacturing systems

A Branch-and-Cut algorithm for the multiple Steiner TSP with order constraints.

Autoren: Taktak, Raouia

Quelle: Annals of Operations Research; Aug2025, Vol. 351 Issue 1, p993-1021, 29p

Schlagwörter: TRAVELING salesman problem, MIXED integer linear programming, CONSTRAINT programming, QUANTITATIVE research, MATHEMATICAL inequalities, BRANCH & bound algorithms, MATHEMATICAL optimization

Strongly Stable Matchings under Matroid Constraints.

Autoren: Kamiyama, Naoyuki

Quelle: SIAM Journal on Discrete Mathematics; 2025, Vol. 39 Issue 3, p1471-1490, 20p

Schlagwörter: POLYNOMIAL time algorithms, MATROIDS, MATCHING theory, ALGORITHMS

On Constrained Mixed-Integer DR-Submodular Minimization.

Autoren: Yu, Qimeng Küçükyavuz, Simge

Quelle: Mathematics of Operations Research; May2025, Vol. 50 Issue 2, p871-909, 39p

Schlagwörter: POLYHEDRAL combinatorics, NONLINEAR equations, CONTINUOUS functions, INTEGERS, ALGORITHMS

Minimizing Convex Functions with Rational Minimizers.

Autoren: JIANG, HAOTIAN

Quelle: Journal of the ACM; Feb2023, Vol. 70 Issue 1, p1-27, 27p

Schlagwörter: SUBMODULAR functions, CONVEX functions, POLYNOMIAL time algorithms, RIESZ spaces, LATTICE theory, CONVEX geometry

Decomposition of probability marginals for security games in max-flow/min-cut systems: Decomposition of probability marginals in max-flow/min-cut systems: J. Matuschke.

Autoren: Matuschke, Jannik

Quelle: Mathematical Programming; Mar2025, Vol. 210 Issue 1, p611-640, 30p

Schlagwörter: DIRECTED acyclic graphs, DISTRIBUTION (Probability theory), RANDOM sets, CONSERVATION laws (Physics), OPEN-ended questions

Submodular Functions and Perfect Graphs.

Autoren: Abrishami, Tara Chudnovsky, Maria Dibek, Cemil et al.

Quelle: Mathematics of Operations Research; Feb2025, Vol. 50 Issue 1, p189-208, 20p

Schlagwörter: SUBMODULAR functions, POLYNOMIAL time algorithms, INDEPENDENT sets, PHYSICAL sciences, PRISMS

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

A network flow approach to a common generalization of Clar and Fries numbers.

Autoren: Bérczi-Kovács, Erika Frank, András

Quelle: Discrete Mathematics. Nov2024, Vol. 347 Issue 11, pN.PAG-N.PAG. 1p.

Schlagwörter: *POLYNOMIAL time algorithms, *POLYHEDRA, *GENERALIZATION, *BIPARTITE graphs, *ALGORITHMS, *POLYNOMIALS, *DIRECTED graphs

NODE-CAPACITATED RING ROUTING.

Autoren: Frank, András Shepherd, Bruce Tandon, Vivek et al.

Quelle: Mathematics of Operations Research; May2002, Vol. 27 Issue 2, p372, 12p

Schlagwörter: RING networks, OPERATIONS research, INDUSTRIAL engineering, POLYNOMIALS, ALGORITHMS, INTEGRALS

A STRONGLY POLYNOMIAL ALGORITHM FOR MINIMAL COST SUBMODULAR FLOW PROBLEMS.

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

Quelle: Mathematics of Operations Research; Feb89, Vol. 14 Issue 1, p60-69, 10p

Schlagwörter: ALGORITHMS, POLYNOMIALS, MATHEMATICS, LOGIC

Minimum cost multiflows in undirected networks.

Autoren: Karzanov, A.

Quelle: Mathematical Programming; Aug1994, Vol. 66 Issue 1-3, p313-325, 13p

A Survey on the Densest Subgraph Problem and its Variants.

Autoren: Lanciano, Tommaso Miyauchi, Atsushi Fazzone, Adriano et al.

Quelle: ACM Computing Surveys; Aug2024, Vol. 56 Issue 8, p1-40, 40p

Schlagwörter: COLUMN generation (Algorithms), DISCRETE mathematics, SUBMODULAR functions, MATHEMATICAL programming, BENFORD'S law (Statistics), APPROXIMATION algorithms, DIRECTED graphs, BIPARTITE graphs