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

DOI10.1016/J.DAM.2023.12.028WikidataQ129666144 ScholiaQ129666144MaRDI QIDQ6202946FDOQ6202946

Authors: Christina Büsing, Sabrina Schmitz 

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

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

Cites Work

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

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