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

DOI10.1016/j.dam.2023.12.028WikidataQ129666144 ScholiaQ129666144MaRDI QIDQ6202946

Sabrina Schmitz, Christina Büsing

Publication date: 27 February 2024

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Single-commodity robust network design with finite and hose demand sets
• Complexity and in-approximability of a selection problem in robust optimization
• Robust location transportation problems under uncertain demands
• Robust combinatorial optimization under convex and discrete cost uncertainty
• Commitment under uncertainty: Two-stage stochastic matching problems
• Robust discrete optimization and its applications
• A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
• On the robust shortest path problem.
• Robust discrete optimization and network flows
• Adjustable robust solutions of uncertain linear programs
• A survey of adjustable robust optimization
• Approximability of the robust representatives selection problem
• Min-max and min-max (relative) regret approaches to representatives selection problem
• Minimum cost flows with minimum quantities
• Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty
• Solving two-stage robust optimization problems using a column-and-constraint generation method
• Bounds on linear PDEs via semidefinite optimization
• Robust minimum cost flow problem under consistent flow constraints
• Recoverable robust shortest path problems
• The Recoverable Robust Two-Level Network Design Problem
• Integer Programming with a Fixed Number of Variables
• Models and Algorithms for Robust Network Design with Several Traffic Scenarios
• Optimality of Affine Policies in Multistage Robust Optimization
• Two-Stage Robust Network Flow and Design Under Demand Uncertainty
• The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
• The Recognition of Series Parallel Digraphs
• Finite Adaptability in Multistage Linear Optimization
• Robust and Adaptive Network Flows
• Recoverable Robust Combinatorial Optimization Problems
• Network Flow Optimization with Minimum Quantities
• Robust capacity expansion of network flows
• Robust network design: Formulations, valid inequalities, and computations
• Automata, Languages and Programming
• Combinatorial optimization. Theory and algorithms.
• Robust transshipment problem under consistent flow constraints

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