Show simple item record

dc.contributor.authorAissi, Hassene*
dc.contributor.authorBazgan, Cristina*
dc.contributor.authorVanderpooten, Daniel*
dc.date.accessioned2011-02-09T14:09:40Z
dc.date.available2011-02-09T14:09:40Z
dc.date.issued2005
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/5687
dc.language.isoenen
dc.subjectmin-max
dc.subjectpseudo-polynomial
dc.subjectcomputational complexity
dc.subjectmin-max regret
dc.subject.ddc003en
dc.titlePseudo-polynomial algorithms for min-max and min-max regret problems
dc.typeCommunication / Conférence
dc.description.abstractenWe present in this paper general pseudo-polynomial time algorithms to solve min-maxand min-max regret versions of some polynomial or pseudo-polynomial problems undera constant number of scenarios. Using easily computable bounds, we can improve thesealgorithms. This way we provide pseudo-polynomial algorithms for the min-max and andmin-max regret versions of several classical problems including minimum spanning tree,shortest path, and knapsack.
dc.identifier.citationpages171-178
dc.relation.ispartoftitleOperations Research and Its Applications. The Fifth International Symposium, ISORA’05 Tibet, China, August 8–13, 2005 Proceedings
dc.relation.ispartofeditorXian-Sun, Zhang
dc.relation.ispartofpublnameWorld Publishing Corporation
dc.relation.ispartofdate2005
dc.description.sponsorshipprivateouien
dc.subject.ddclabelRecherche opérationnelleen
dc.relation.ispartofisbn7-5062-7277-6
dc.relation.confcountryCHINA
dc.description.ssrncandidatenon
dc.description.halcandidateoui
dc.description.readershiprecherche
dc.description.audienceInternational
dc.date.updated2016-10-06T10:19:28Z
hal.person.labIds*
hal.person.labIds*
hal.person.labIds*


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record