Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)

Set Packing Relaxations of Some Integer Programs

Please always quote using this URN: urn:nbn:de:0297-zib-2998
  • This paper is about {\em set packing relaxations\/} of combinatorial optimization problems associated with acyclic digraphs and linear orderings, cuts and multicuts, and vertex packings themselves. Families of inequalities that are valid for such a relaxation as well as the associated separation routines carry over to the problems under investigation.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics - number of accesses to the document
Author:Ralf BorndörferORCiD, Robert Weismantel
Document Type:ZIB-Report
Date of first Publication:1997/06/30
Series (Serial Number):ZIB-Report (SC-97-30)
Published in:Appeared in: Mathematical Programming, 88,425-450, 2000
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.