Generalized Conflict Learning for Hybrid Discrete/Linear Optimization
From MaRDI portal
Publication:3524194
DOI10.1007/11564751_32zbMath1153.90580OpenAlexW1498079062MaRDI QIDQ3524194
Publication date: 9 September 2008
Published in: Principles and Practice of Constraint Programming - CP 2005 (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/32466
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (3)
Consistency checking of STNs with decisions: managing temporal and access-control constraints in a seamless way ⋮ Conflict-directed \(A^{*}\) and its role in model-based embedded systems ⋮ A conflict-directed approach to chance-constrained mixed logical linear programming
Uses Software
This page was built for publication: Generalized Conflict Learning for Hybrid Discrete/Linear Optimization
