Recourse problem of the 2-stage robust location transportation problem

DOI10.1016/J.ENDM.2010.05.022zbMATH Open1237.90041OpenAlexW2004157373MaRDI QIDQ2883563FDOQ2883563

Authors: V. Gabrel, C. Murat, 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

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

Cites Work

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

Cited In (3)

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

This page was built for publication: Recourse problem of the 2-stage robust location transportation problem

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