Explanation-based large neighborhood search
From MaRDI portal
Publication:2342597
DOI10.1007/s10601-014-9166-6zbMath1316.90048OpenAlexW2002462348MaRDI QIDQ2342597
Charles Prud'homme, Xavier Lorca, Narendra Jussien
Publication date: 29 April 2015
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-014-9166-6
Cites Work
- Unnamed Item
- Unnamed Item
- Constraint solving in uncertain and dynamic environments: A survey
- Identifying and exploiting problem structures using explanation-based constraint programming
- Local search with constraint propagation and conflict-based heuristics
- Large neighbourhood search algorithms for the founder sequence reconstruction problem
- Solving a network design problem
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- Propagation via lazy clause generation
- Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
- Tuning Parameters of Large Neighborhood Search for the Machine Reassignment Problem
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Principles and Practice of Constraint Programming – CP 2004
This page was built for publication: Explanation-based large neighborhood search
