Generalized Conflict Learning for Hybrid Discrete/Linear Optimization

DOI10.1007/11564751_32MaRDI QIDQ3524194zbMATH OpenOpenAlexFDO

Authors Hui Li, Brian C. Williams

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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Best-first enumeration based on bounding conflicts, and its application to large-scale hybrid estimation
• Hybrid Systems: Computation and Control
• Conflict-directed \(A^{*}\) and its role in model-based embedded systems
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Cited in

(4)

• Conflict-directed \(A^{*}\) and its role in model-based embedded systems
• Best-first enumeration based on bounding conflicts, and its application to large-scale hybrid estimation
• A conflict-directed approach to chance-constrained mixed logical linear programming
• Consistency checking of STNs with decisions: managing temporal and access-control constraints in a seamless way

Describes a project that uses

Uses Software

• QOCA

This page was built for publication: Generalized Conflict Learning for Hybrid Discrete/Linear Optimization

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