Complexity of strict robust integer minimum cost flow problems: an overview and further results

DOI10.1016/j.cor.2018.12.021zbMath1458.90606OpenAlexW2906210228WikidataQ128671240 ScholiaQ128671240MaRDI QIDQ1725614

Anika Kinscherff, André B. Chassein

Publication date: 14 February 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.12.021

zbMATH Keywords

combinatorial optimizationrobust optimizationlabeling algorithmsintegral flows

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (1)

Two-stage matching-and-scheduling algorithm for real-time private parking-sharing programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A bicriteria approach to robust optimization
• A robust bus evacuation model with delayed scenario information
• Robust optimization model for a dynamic network design problem under demand uncertainty
• An aggregate label setting policy for the multi-objective shortest path problem
• On a multicriteria shortest path problem
• Evacuation transportation planning under uncertainty: A robust optimization approach
• Polynomial-time identification of robust network flows under uncertain arc failures
• A comparison of solution strategies for biobjective shortest path problems
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• A multicriteria Pareto-optimal path algorithm
• Parallel recognition of series-parallel graphs
• Robust solutions of uncertain linear programs
• Robust discrete optimization and its applications
• On the robust shortest path problem.
• Robust discrete optimization and network flows
• Adjustable robust solutions of uncertain linear programs
• Robust solutions of linear programming problems contaminated with uncertain data
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Robust Convex Optimization
• Earliest arrival flows on series-parallel graphs
• A Soft Robust Model for Optimization Under Ambiguity
• The Price of Robustness
• The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
• On a Class of Totally Unimodular Matrices
• Robust and Adaptive Network Flows
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• Multicriteria Optimization
• Constructing Maximal Dynamic Flows from Static Flows
• Minimum cost network flows: Problems, algorithms, and software

This page was built for publication: Complexity of strict robust integer minimum cost flow problems: an overview and further results