Algorithmes hybrides génériques pour la résolution de problèmes de satisfaction de contraintes

DOI10.1051/ro:2005006zbMath1104.90056OpenAlexW2050413229MaRDI QIDQ5479853

Frédéric Saubion, Jin-Kao Hao, Hervé Deleau

Publication date: 11 July 2006

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2005__39_2_87_0

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• CHIP
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Local search with constraint propagation and conflict-based heuristics
• Introducing global constraints in CHIP
• Heterogeneous constraint solving
• Local Search and Constraint Programming
• From chaotic iteration to constraint propagation
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

This page was built for publication: Algorithmes hybrides génériques pour la résolution de problèmes de satisfaction de contraintes