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

DOI10.1007/S10479-010-0730-1zbMATH Open1214.90099OpenAlexW2041507489MaRDI QIDQ545533FDOQ545533

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

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

Cited In (4)

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

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)