Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)
  • Treffer 10 von 39
Zurück zur Trefferliste

Counting solutions of integer programs using unrestricted subtree detection

Zitieren Sie bitte immer diese URN: urn:nbn:de:0297-zib-10632
  • In the recent years there has been tremendous progress in the development of algorithms to find optimal solutions for integer programs. In many applications it is, however, desirable (or even necessary) to generate all feasible solutions. Examples arise in the areas of hardware and software verification and discrete geometry. In this paper, we investigate how to extend branch-and-cut integer programming frameworks to support the generation of all solutions. We propose a method to detect so-called unrestricted subtrees, which allows us to prune the integer program search tree and to collect several solutions simultaneously. We present computational results of this branch-and-count paradigm which show the potential of the unrestricted subtree detection.

Volltext Dateien herunterladen

Metadaten exportieren

Weitere Dienste

Teilen auf Twitter Suche bei Google Scholar Statistik - Anzahl der Zugriffe auf das Dokument
Metadaten
Verfasserangaben:Tobias AchterbergORCiD, Stefan Heinz, Thorsten KochORCiD
Dokumentart:ZIB-Report
Freies Schlagwort / Tag:IP; Zählen; ganzzahlige Programme
IP; counting; integer programming
MSC-Klassifikation:90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C10 Integer programming
Datum der Erstveröffentlichung:26.02.2008
Schriftenreihe (Bandnummer):ZIB-Report (08-09)
ISSN:1438-0064
ZIB-Reportnummer:08-09
Verlagspublikation:App. in: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : 5th International Conference, CPAIOR 2008 Paris, France, 2008; proc., Laurent Perron ... (eds.), LNC 5015, Springer 2008, pp. 278-282
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.