Robust location transportation problems under uncertain demands

DOI10.1016/j.dam.2011.09.015zbMath1331.90096OpenAlexW2080263727MaRDI QIDQ496635

N. Remli, Cécile Murat, Mathieu Lacroix, Virginie Gabrel

Publication date: 22 September 2015

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

Full work available at URL: https://doi.org/10.1016/j.dam.2011.09.015

zbMATH Keywords

convex optimizationrobust optimizationmixed integer linear programminginterval uncertaintylocation transportation problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Minimax problems in mathematical programming (90C47) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (33)

Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective ⋮ Robust Stochastic Facility Location: Sensitivity Analysis and Exact Solution ⋮ Robust flows with losses and improvability in evacuation planning ⋮ A two-stage robust optimization approach for the mobile facility fleet sizing and routing problem under uncertainty ⋮ A computational study of exact approaches for the adjustable robust resource-constrained project scheduling problem ⋮ Robust Capacity Planning for Project Management ⋮ Managing reliable emergency logistics for hazardous materials: a two-stage robust optimization approach ⋮ Adjustable robust optimization with objective uncertainty ⋮ An effective global algorithm for worst-case linear optimization under polyhedral uncertainty ⋮ Consensus-based Dantzig-Wolfe decomposition ⋮ Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints ⋮ 2-stage robust MILP with continuous recourse variables ⋮ Solving two-stage robust optimization problems using a column-and-constraint generation method ⋮ Ambulance Emergency Response Optimization in Developing Countries ⋮ Reducing Conservatism in Robust Optimization ⋮ A robust basic cyclic scheduling problem ⋮ A two-stage robust model for a reliable \(p\)-center facility location problem ⋮ A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides ⋮ Two-stage robust optimization approach to elective surgery and downstream capacity planning ⋮ Supply location and transportation planning for hurricanes: a two-stage stochastic programming framework ⋮ Robust multicovers with budgeted uncertainty ⋮ Recent advances in robust optimization: an overview ⋮ Saddle point approximation approaches for two-stage robust optimization problems ⋮ Oracle-based algorithms for binary two-stage robust optimization ⋮ Fuzzy efficient interactive goal programming approach for multi-objective transportation problems ⋮ Decomposition for adjustable robust linear optimization subject to uncertainty polytope ⋮ Development of a scenario-based robust model for the optimal truck-shovel allocation in open-pit mining ⋮ Robust Defibrillator Deployment Under Cardiac Arrest Location Uncertainty via Row-and-Column Generation ⋮ Robust global sourcing under compliance legislation ⋮ Robust and stochastic formulations for ambulance deployment and dispatch ⋮ Duality in Two-Stage Adaptive Linear Optimization: Faster Computation and Stronger Bounds ⋮ Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties ⋮ Robust Optimization for Electricity Generation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Robust discrete optimization and network flows
• Adjustable robust solutions of uncertain linear programs
• Theory and Applications of Robust Optimization
• The Cutting-Plane Method for Solving Convex Programs
• Two-Stage Robust Network Flow and Design Under Demand Uncertainty
• The Price of Robustness
• A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
• A cutting plane algorithm for solving bilinear programs
• A linear max—min problem
• Robustness and duality in linear programming
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming

This page was built for publication: Robust location transportation problems under uncertain demands