Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow

DOI10.1007/978-3-319-08437-4_4zbMath1314.90071OpenAlexW201131573MaRDI QIDQ5256763

Annegret K. Wagler

Publication date: 19 June 2015

Published in: Large-Scale Networks in Engineering and Life Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08437-4_4

zbMATH Keywords

linear programmingdualityunimodularityinteger linear programmingnetwork flowmax-flow min-cut theorem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Linear programming (90C05) Combinatorial optimization (90C27)

Related Items (1)

\texttt{EXPEDIS}: an exact penalty method over discrete sets

Cites Work

• A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts
• Geometric algorithms and combinatorial optimization
• Elementare Theorie der konvexen Polyeder
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Optimizing over the split closure
• Edmonds polytopes and a hierarchy of combinatorial problems
• Intersection Cuts with Infinite Split Rank
• Maximal Flow Through a Network
• Outline of an algorithm for integer solutions to linear programs
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• New Finite Pivoting Rules for the Simplex Method
• Linear Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow