Separation, dimension, and facet algorithms for node flow polyhedra
From MaRDI portal
Publication:2638390
DOI10.1007/s10107-010-0378-2zbMath1220.90039OpenAlexW2077734616MaRDI QIDQ2638390
Maren Martens, Maurice Queyranne, S. Thomas McCormick
Publication date: 16 September 2010
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-010-0378-2
Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding minimum-cost flows by double scaling
- On the computational behavior of a polynomial-time network flow algorithm
- Geometric algorithms and combinatorial optimization
- How to compute least infeasible flows
- Material compatibility constraints for make-to-order production planning.
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- On the symmetric travelling salesman problem II: Lifting theorems and facets
- Beyond the flow decomposition barrier
- Finding Minimum-Cost Circulations by Successive Approximation
- A Polynomial Algorithm for Weighted Abstract Flow
- A new approach to the maximum-flow problem
- Improved Time Bounds for the Maximum Flow Problem
- On the structure of all minimum cuts in a network and applications
- Computing Maximal “Polymatroidal” Network Flows
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- A generalization of max flow—min cut
- A Faster Deterministic Maximum Flow Algorithm
- A Randomized Maximum-Flow Algorithm
- Scaling Algorithms for the Shortest Paths Problem
- Online load balancing and network flow
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
This page was built for publication: Separation, dimension, and facet algorithms for node flow polyhedra
