Rapid Learning for Binary Programs

DOI10.1007/978-3-642-13520-0_8zbMath1285.68151OpenAlexW1549710443MaRDI QIDQ3569919

Thibaut Feydy, Timo Berthold, Peter J. Stuckey

Publication date: 22 June 2010

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13520-0_8

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (7)

Transferring information across restarts in MIP ⋮ Shift-and-propagate ⋮ Structure-driven fix-and-propagate heuristics for mixed integer programming ⋮ RENS. The optimal rounding ⋮ Computational aspects of infeasibility analysis in mixed integer programming ⋮ Conflict Analysis for MINLP ⋮ Conflict-Driven Heuristics for Mixed Integer Programming

Uses Software

• SCIP
• MIPLIB
• Benchmarks for Optimization Software
• Chaff

This page was built for publication: Rapid Learning for Binary Programs