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

DOI10.1016/J.COR.2018.12.021zbMATH Open1458.90606OpenAlexW2906210228WikidataQ128671240 ScholiaQ128671240MaRDI QIDQ1725614FDOQ1725614

Authors: Anika Kinscherff, André 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

Recommendations

• Robust minimum cost flow problem under consistent flow constraints
• Robust discrete optimization and network flows
• On robust maximum flow with polyhedral uncertainty sets
• The robust shortest path problem in series -- parallel multidigraphs with interval data
• Dynamic network flows with uncertain costs belonging to interval

zbMATH Keywords

combinatorial optimizationrobust optimizationlabeling algorithmsintegral flows

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Two-stage matching-and-scheduling algorithm for real-time private parking-sharing programs
• An efficient algorithm for solving minimum cost flow problem with complementarity slack conditions

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

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