Constraint-based local search for constrained optimum paths problems
DOI10.1007/978-3-642-13520-0_29zbMATH Open1285.68160OpenAlexW1636359169MaRDI QIDQ3569937FDOQ3569937
Authors: Quang Dung Pham, Yves Deville, Pascal Van Hentenryck 
Publication date: 22 June 2010
Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13520-0_29
Recommendations
- LS(graph): a constraint-based local search for constraint optimization on trees and paths
- scientific article; zbMATH DE number 1670670
- On an exact method for the constrained shortest path problem
- Lagrangian relaxation and enumeration for solving constrained shortest-path problems
- An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)
Cited In (7)
- Soft constraint logic programming and generalized shortest path problems
- Reasoning on sequences in constraint-based local search frameworks
- Title not available (Why is that?)
- Toward unification of exact and heuristic optimization methods
- Local optimization of dynamic programs with guaranteed satisfaction of path constraints
- LS(graph): a constraint-based local search for constraint optimization on trees and paths
- Generic support for precomputation-based global routing constraints in local search optimization
Uses Software
This page was built for publication: Constraint-based local search for constrained optimum paths problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569937)
