Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems
Date
2008Link to item file
http://hal.archives-ouvertes.fr/hal-00116639/en/Dewey
Recherche opérationnelleSujet
Worst-case Complexity; Dominance Conditions; Set Covering; Max CutJournal issue
Operational ResearchVolume
8Number
3Publication date
11-2008Article pages
235-256Publisher
SpringerCollections
Metadata
Show full item recordAuthor
Paschos, Vangelis
Della Croce, Federico