• Deutsch
Login

  • Home
  • Search
  • Browse
  • Publish
  • FAQ
  • MSC-Classification
  • 68-XX COMPUTER SCIENCE (For papers involving machi...
  • 68Qxx Theory of computing

68Q32 Computational learning theory [See also 68T05]

Refine

Author

  • Berthold, Timo (1)
  • Feydy, Thibaut (1)
  • Stuckey, Peter (1)

Year of publication

  • 2010 (1)

Document Type

  • ZIB-Report (1)

Language

  • English (1)

Has Fulltext

  • yes (1)

Is part of the Bibliography

  • no (1)

Keywords

  • Constraintprogrammierung (1)
  • Ganzzahlige Programmierung (1)
  • Konfliktanalyse (1)
  • Primalheuristik (1)
  • conflict learning (1)
  • constraint programming (1)
  • integer programming (1)
  • primal heuristic (1)

Institute

  • Mathematical Optimization (1)

1 search hit

  • 1 to 1
  • BibTeX
  • CSV
  • RIS
  • XML
  • 10
  • 20
  • 50
  • 100
Rapid Learning for Binary Programs (2010)
Berthold, Timo ; Feydy, Thibaut ; Stuckey, Peter
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.
  • 1 to 1

OPUS4 Logo

  • Contact
  • Impressum und Datenschutz
  • Sitelinks