Recourse problem of the 2-stage robust location transportation problem

DOI10.1016/J.ENDM.2010.05.022MaRDI QIDQ2883563zbMATH OpenOpenAlexFDO

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

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

Cited in

(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

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)