Refine
Year of publication
- 2010 (2)
Document Type
- In Proceedings (1)
- ZIB-Report (1)
Language
- English (2)
Is part of the Bibliography
- no (2)
Keywords
- Constraintprogrammierung (1)
- Ganzzahlige Programmierung (1)
- Konfliktanalyse (1)
- Primalheuristik (1)
- conflict learning (1)
- constraint programming (1)
- integer programming (1)
- primal heuristic (1)
Institute
Learning during search allows solvers for discrete optimization problems to remember parts of the search that they have already performed and avoid revisiting redundant parts. Learning approaches pioneered by the SAT and CP communities have been successfully incorporated into the SCIP constraint integer programming platform. In this paper we show that performing a heuristic constraint programming search during root node processing of a binary program can rapidly learn useful nogoods, bound changes, primal solutions, and branching statistics that improve the remaining IP search.
