Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts
From MaRDI portal
Publication:5387638
DOI10.1007/978-3-540-68155-7_23zbMath1142.90493MaRDI QIDQ5387638
Publication date: 27 May 2008
Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-68155-7_23
90C35: Programming involving graphs or networks
Related Items
Uses Software
Cites Work
- On implementing the push-relabel method for the maximum flow problem
- Robust discrete optimization and network flows
- Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem
- Maximal Flow Through a Network
- Market equilibrium via a primal--dual algorithm for a convex program
- Investing in arcs in a network to maximize the expected max flow
- A new approach to the maximum-flow problem
- Multiprocessor Scheduling with the Aid of Network Flow Algorithms
- Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time
- Optimal Protein Structure Alignment Using Maximum Cliques