Some tractable instances of interval data minmax regret problems

dc.contributor.author	Escoffier, Bruno HAL ID: 5124
dc.contributor.author	Monnot, Jérôme HAL ID: 178759 ORCID: 0000-0002-7452-6553
dc.contributor.author	Spanjaard, Olivier HAL ID: 14601
dc.date.accessioned	2010-02-17T13:10:11Z
dc.date.available	2010-02-17T13:10:11Z
dc.date.issued	2008
dc.identifier.uri	https://basepub.dauphine.fr/handle/123456789/3490
dc.language.iso	en	en
dc.subject	Bipartite perfect matching	en
dc.subject	Spanning tree	en
dc.subject	Shortest path	en
dc.subject	Interval data	en
dc.subject	Robust optimization	en
dc.subject.ddc	003	en
dc.title	Some tractable instances of interval data minmax regret problems	en
dc.type	Article accepté pour publication ou publié
dc.description.abstracten	In this paper, we provide polynomial and pseudopolynomial algorithms for classes of particular instances of interval data minmax regret graph problems. These classes are defined using a parameter that measures the distance from well-known solvable instances. Tractable cases occur when the parameter is bounded by a constant.	en
dc.relation.isversionofjnlname	Operations Research Letters
dc.relation.isversionofjnlvol	36	en
dc.relation.isversionofjnlissue	4	en
dc.relation.isversionofjnldate	2008-07
dc.relation.isversionofjnlpages	424-429	en
dc.relation.isversionofdoi	http://dx.doi.org/10.1016/j.orl.2007.12.004	en
dc.description.sponsorshipprivate	oui	en
dc.relation.isversionofjnlpublisher	Elsevier	en
dc.subject.ddclabel	Recherche opérationnelle	en

Related items