Recourse problem of the 2-stage robust location transportation problem

dc.contributor.author	Remli, Nabila
dc.contributor.author	Murat, Cécile
dc.contributor.author	Gabrel, Virginie
dc.contributor.author	Lacroix, Mathieu HAL ID: 741352 ORCID: 0000-0001-8385-3890
dc.date.accessioned	2010-04-27T14:13:39Z
dc.date.available	2010-04-27T14:13:39Z
dc.date.issued	2010
dc.identifier.uri	https://basepub.dauphine.fr/handle/123456789/4017
dc.language.iso	en	en
dc.subject	Location transportation problem	en
dc.subject	robust optimization	en
dc.subject	mixed-integer linear programming	en
dc.subject.ddc	003	en
dc.title	Recourse problem of the 2-stage robust location transportation problem	en
dc.type	Communication / Conférence
dc.description.abstracten	In this paper, we are interesting in the recourse problem of the 2-stage robust location transportation problem. We propose a resolution using a mixed-integer formulation with an appropriate tight bound.	en
dc.relation.isversionofjnlname	Electronic Notes in Discrete Mathematics
dc.relation.isversionofjnlvol	36
dc.relation.isversionofjnldate	2010-08
dc.relation.isversionofjnlpages	167-174
dc.relation.isversionofdoi	http://dx.doi.org/10.1016/j.endm.2010.05.022
dc.description.sponsorshipprivate	oui	en
dc.relation.isversionofjnlpublisher	Elsevier
dc.subject.ddclabel	Recherche opérationnelle	en
dc.relation.conftitle	ISCO International Symposium on Combinatorial Optimization	en
dc.relation.confdate	2010-03
dc.relation.confcity	Hammamet	en
dc.relation.confcountry	Tunisie	en

Related items