Recourse problem of the 2-stage robust location transportation problem

DOI10.1016/j.endm.2010.05.022zbMath1237.90041OpenAlexW2004157373MaRDI QIDQ2883563

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

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://basepub.dauphine.fr/handle/123456789/4017

zbMATH Keywords

robust optimizationmixed-integer linear programminglocation transportation problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (3)

Recourse problem of the 2-stage robust location transportation problem ⋮ New models for the robust shortest path problem: complexity, resolution and generalization ⋮ A survey of adjustable robust optimization

Cites Work

• Adjustable robust solutions of uncertain linear programs
• Recourse problem of the 2-stage robust location transportation problem
• The Cutting-Plane Method for Solving Convex Programs
• Two-Stage Robust Network Flow and Design Under Demand Uncertainty
• The Price of Robustness
• 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: Recourse problem of the 2-stage robust location transportation problem