Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints

DOI10.1016/J.DAM.2023.12.028MaRDI QIDQ6202946zbMATH OpenWikidataFDO

Authors Christina Büsing, Sabrina Schmitz

Publication date 27 February 2024

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2023.12.028

zbMATH Keywords

robust shortest path problemdiscrete demand uncertaintyrobust minimum weight perfect \(b\)-matching problemrobust representative (multi-)selection problemrobust two-stage

Mathematics Subject Classification ID

Operations research and management science (90Bxx) Theory of computing (68Qxx) Mathematical programming (90Cxx)

Recommendations

• Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty
• Solving robust two-stage combinatorial optimization problems under convex uncertainty
• Min-max-min robust combinatorial optimization
• Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty
• Robust combinatorial optimization under convex and discrete cost uncertainty

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
• A survey of adjustable robust optimization
• Adjustable robust solutions of uncertain linear programs
• Approximability of the robust representatives selection problem
• Automata, Languages and Programming
• Bounds on linear PDEs via semidefinite optimization
• Combinatorial optimization. Theory and algorithms.
• Commitment under uncertainty: Two-stage stochastic matching problems
• Complexity and in-approximability of a selection problem in robust optimization
• Finite Adaptability in Multistage Linear Optimization
• Integer Programming with a Fixed Number of Variables
• Min-max and min-max (relative) regret approaches to representatives selection problem
• Minimum cost flows with minimum quantities
• Models and algorithms for robust network design with several traffic scenarios
• Network flow optimization with minimum quantities
• On the robust shortest path problem.
• Optimality of affine policies in multistage robust optimization
• Recoverable Robust Combinatorial Optimization Problems
• Recoverable robust shortest path problems
• Robust and adaptive network flows
• Robust capacity expansion of network flows
• Robust combinatorial optimization under convex and discrete cost uncertainty
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• Robust location transportation problems under uncertain demands
• Robust minimum cost flow problem under consistent flow constraints
• Robust network design: formulations, valid inequalities, and computations
• Robust transshipment problem under consistent flow constraints
• Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty
• Single-commodity robust network design with finite and hose demand sets
• Solving two-stage robust optimization problems using a column-and-constraint generation method
• The Recognition of Series Parallel Digraphs
• The concept of recoverable robustness, linear programming recovery, and railway applications
• The recoverable robust two-level network design problem
• Two-Stage Robust Network Flow and Design Under Demand Uncertainty

Cited in

(3)

• On the complexity of robust multi-stage problems with discrete recourse
• Combinatorial robust optimization with decision-dependent information discovery and polyhedral uncertainty
• Complexity of the directed robust b-matching problem and its variants on different graph classes

This page was built for publication: Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints

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