Rapid learning for binary programs

DOI10.1007/978-3-642-13520-0_8MaRDI QIDQ3569919zbMATH OpenOpenAlexFDO

Authors Timo Berthold, Thibaut Feydy, 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

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

Recommendations

• Learning in search
• Learning value heuristics for constraint programming
• Parallelizing constraint programming with learning
• On learning and branching: a survey
• Learning General Constraints in CSP

Cited in

(11)

• Computational aspects of infeasibility analysis in mixed integer programming
• Transferring information across restarts in MIP
• Structure-driven fix-and-propagate heuristics for mixed integer programming
• Local rapid learning for integer programs
• Learning in search
• Conflict Analysis for MINLP
• Conflict-Driven Heuristics for Mixed Integer Programming
• Shift-and-propagate
• One-shot learning for MIPs with SOS1 constraints
• A fix-propagate-repair heuristic for mixed integer programming
• RENS. The optimal rounding

Describes a project that uses

Uses Software

• SCIP
• MIPLIB
• Benchmarks for Optimization Software
• Chaff

This page was built for publication: Rapid learning for binary programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569919)