Robust location transportation problems under uncertain demands
type: Item
instance of: scholarly article
title: Robust location transportation problems under uncertain demands
zbMATH Open document ID: 1331.90096
author: N. Remli
author: V. Gabrel
author: Mathieu Lacroix
author: C. Murat
published in: Discrete Applied Mathematics
publication date: 2015-09-22T00:00:00Z
Mathematics Subject Classification ID: 90C47
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C08
zbMATH DE Number: 6484183
zbMATH Keywords: robust optimization
zbMATH Keywords: interval uncertainty
zbMATH Keywords: convex optimization
zbMATH Keywords: mixed integer linear programming
zbMATH Keywords: location transportation problem
MaRDI profile type: Publication
full work available at URL: j.dam.2011.09.015
OpenAlex ID: W2080263727
cites work: Two-Stage Robust Network Flow and Design Under Demand Uncertainty
cites work: Q3182207
cites work: Adjustable robust solutions of uncertain linear programs
cites work: Theory and Applications of Robust Optimization
cites work: Robust discrete optimization and network flows
cites work: The Price of Robustness
cites work: A linear max—min problem
cites work: Robustness and duality in linear programming
cites work: Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
cites work: Q4889854
cites work: The Cutting-Plane Method for Solving Convex Programs
cites work: A cutting plane algorithm for solving bilinear programs
cites work: A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
cites work: Q3137900
DOI: 10.1016/J.DAM.2011.09.015
description: scientific article; zbMATH DE number 6484183