Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

DOI10.1007/b96957zbMath1094.90566OpenAlexW2498803556MaRDI QIDQ5713883

Petr Vilím

Publication date: 27 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b96957

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (6)

Linear-time filtering algorithms for the disjunctive constraint and a quadratic filtering algorithm for the cumulative not-first not-last ⋮ Arc-B-consistency of the inter-distance constraint ⋮ Strong polynomiality of resource constraint propagation ⋮ Efficient filtering for the resource-cost alldifferent constraint ⋮ An Optimal Constraint Programming Approach to the Open-Shop Problem ⋮ View-based propagator derivation

This page was built for publication: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems