ZIB

Treffer pro Seite

Treffer 11 - 11 | 11 Treffer

Sortierung

Unbekannt

Discrete Relaxations of Combinatorial Programs (1997)

Borndörfer, Ralf ; Weismantel, Robert

zur Merkliste hinzufügen auf der Merkliste

Details

Publikationsdatum: 2020-08-05

Beschreibung: This paper investigates {\em relations\/} among combinatorial optimization problems. To establish such relations we introduce a transformation technique \mbox{---{\em aggregation}---} that allows to relax an integer program by means of another integer program. We prove that various families of prominent inequalities for the acyclic subdigraph problem, the multiple knapsack problem, the max cut, graph, and the clique partitioning problem, the set covering problem, and the set packing problem can be derived and separated in polynomial time in this way. Our technique is algorithmic. It has been implemented and used in a set partitioning code.

Schlagwort(e): ddc:000

Sprache: Englisch

Materialart: reportzib , doc-type:preprint

Format: application/postscript

Format: application/pdf

Permalink

Bibliothek	Standort	Signatur	Band/Heft/Jahr	Verfügbarkeit

Andere fanden auch interessant ...

OPUS

PDF

Überblick

Treffer 11 - 11 | 11 Treffer