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

DOI10.1007/s10479-010-0730-1zbMath1214.90099OpenAlexW2041507489MaRDI QIDQ545533

Özlem Ergun, Douglas S. Altner

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)

Related Items (1)

Tailored Lagrangian relaxation for the open pit block sequencing problem

Uses Software

• Netsoft

Cites Work

• Unnamed Item
• An analysis of the highest-level selection rule in the preflow-push max-flow algorithm
• On implementing the push-relabel method for the maximum flow problem
• Robust discrete optimization and network flows
• Robust Convex Optimization
• Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem
• Solving Project Scheduling Problems by Minimum Cut Computations
• Beyond the flow decomposition barrier
• Maximal Flow Through a Network
• Two-Stage Robust Network Flow and Design Under Demand Uncertainty
• A new approach to the maximum-flow problem
• Multiprocessor Scheduling with the Aid of Network Flow Algorithms
• Robust capacity expansion of network flows
• 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
• PRACTICAL EFFICIENCY OF MAXIMUM FLOW ALGORITHMS USING MA ORDERINGS AND PREFLOWS

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