Show simple item record

dc.contributor.authorKalaï, Rim
dc.contributor.authorAloulou, Mohamed Ali
dc.contributor.authorVallin, Philippe
dc.contributor.authorVanderpooten, Daniel
dc.date.accessioned2010-07-02T12:56:39Z
dc.date.available2010-07-02T12:56:39Z
dc.date.issued2006
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/4529
dc.language.isoenen
dc.subject1-center location problemen
dc.subjectUncertainty modellingen
dc.subjectRobustnessen
dc.subject.ddc003en
dc.titleMinmax regret 1-center problem on a network with a discrete set of scenariosen
dc.typeDocument de travail / Working paper
dc.description.abstractenWe consider the minmax regret 1-center problem on a general network with uncertainty on demands. Unlike other papers which considered the problem under interval uncertainty, we assume here that demand uncertainty is modelled by a finite number of discrete scenarios. We develop a solution approach based on the decomposition of the network into basic intervals and present a polynomial algorithm for the problem. Finally, we illustrate our approach with an example.en
dc.publisher.nameUniversité Paris-Dauphineen
dc.publisher.cityParisen
dc.identifier.citationpages13en
dc.relation.ispartofseriestitleCahier du LAMSADEen
dc.relation.ispartofseriesnumber132en
dc.description.sponsorshipprivateouien
dc.subject.ddclabelRecherche opérationnelleen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record