A constraint programming framework for local search methods
From MaRDI portal
Recommendations
Cited in
(39)- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- Advances in Artificial Intelligence – SBIA 2004
- Principles and Practice of Constraint Programming – CP 2004
- scientific article; zbMATH DE number 2209661 (Why is no real title available?)
- Declarative local search for predicate logic
- scientific article; zbMATH DE number 2083802 (Why is no real title available?)
- Improved local search for CP toolkits
- Reasoning on sequences in constraint-based local search frameworks
- Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- Solving hierarchical constraints over finite domains with local search
- Local search in problems with nonconvex constraints
- Contraint-based combinators for local search
- Combining incomplete search and clause generation: an application to the orienteering problems with time windows
- Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints
- Hybrids of Constructive Metaheuristics and Constraint Programming: A Case Study with ACO
- Local branching in a constraint programming framework
- scientific article; zbMATH DE number 2084730 (Why is no real title available?)
- A general approach for constraint solving by local search
- A constraint-based local search backend for MiniZinc
- Local Search and Constraint Programming
- Constraint Programming and Local Search Hybrids
- scientific article; zbMATH DE number 2159472 (Why is no real title available?)
- Bounding, filtering and diversification in CP-based local branching
- Local optimization of dynamic programs with guaranteed satisfaction of path constraints
- A framework for constructing complete algorithms based on local search
- A unified framework for partial and hybrid search methods in constraint programming
- Combining local and global search in a constraint programming environment
- LocalSolver 1.x: A black-box local-search solver for 0-1 programming
- Hybridizing exact methods and metaheuristics: a taxonomy
- LS(graph): a constraint-based local search for constraint optimization on trees and paths
- Neighborhood portfolio approach for local search applied to timetabling problems
- Integrating operations research in constraint programming
- A one-dimensional local tuning algorithm for solving GO problems with partially defined constraints
- New model and heuristics for safety stock placement in general acyclic supply chain networks
- Vehicle routing problem with time windows and a limited number of vehicles.
- Integrating operations research in constraint programming
- Generic support for precomputation-based global routing constraints in local search optimization
This page was built for publication: A constraint programming framework for local search methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854899)
