Cutting to the Chase: Solving Linear Integer Arithmetic
We describe a new algorithm for solving linear integer programming problems. The algorithm performs a DPLL style search for a feasible assignment, while using a novel cut procedure to guide the search away from the conflicting states.
Gespeichert in:
Veröffentlicht in: | Journal of automated reasoning 2013-06, Vol.51 (1), p.79-108 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | We describe a new algorithm for solving linear integer programming problems. The algorithm performs a DPLL style search for a feasible assignment, while using a novel cut procedure to guide the search away from the conflicting states. |
---|---|
ISSN: | 0168-7433 1573-0670 |
DOI: | 10.1007/s10817-013-9281-x |