Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems

DOI10.1007/S10479-010-0730-1MaRDI QIDQ545533zbMATH OpenOpenAlexFDO

Authors Douglas S. Altner, Özlem Ergun

Publication date 22 June 2011

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-010-0730-1

zbMATH Keywords

robust network optimizationmaximum flowsGoldberg-Tarjan algorithmincremental maximum flow algorithmsreoptimization heuristicsrobust minimum cuts

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts
• Minimum cut problem using bases of extended polymatroids
• Implementing an efficient minimum capacity cut algorithm
• scientific article; zbMATH DE number 742961
• An exact algorithm for robust network design

Cites work

• A new approach to the maximum-flow problem
• An analysis of the highest-level selection rule in the preflow-push max-flow algorithm
• Beyond the flow decomposition barrier
• Maximal Flow Through a Network
• Modelling some robust design problems via conic optimization
• Multiprocessor Scheduling with the Aid of Network Flow Algorithms
• Network flows. Theory, algorithms, and applications.
• On implementing the push-relabel method for the maximum flow problem
• Optimal Protein Structure Alignment Using Maximum Cliques
• PRACTICAL EFFICIENCY OF MAXIMUM FLOW ALGORITHMS USING MA ORDERINGS AND PREFLOWS
• Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts
• Robust capacity expansion of network flows
• Robust convex optimization
• Robust discrete optimization and network flows
• Solving project scheduling problems by minimum cut computations
• Solving the bi-objective maximum-flow network-interdiction problem
• Two-Stage Robust Network Flow and Design Under Demand Uncertainty

Cited in

(4)

• Tailored Lagrangian relaxation for the open pit block sequencing problem
• An efficient network flow code for finding all minimum cost \(s-t\) cutsets
• Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts
• Finding robust minimum cuts

Describes a project that uses

Uses Software

• Netsoft

This page was built for publication: Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q545533)