A constraint programming framework for local search methods
From MaRDI portal
Publication:1854899
DOI10.1023/A:1009694016861zbMath1064.90577OpenAlexW1506813493MaRDI QIDQ1854899
Michel Gendreau, Gilles Pesant
Publication date: 1999
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009694016861
tabu searchlocal searchconstraint programmingtraveling salesman problem with time windowsinterface constraintsneighborhood modelpersonnel scheduling problem
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (14)
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 ⋮ Combining incomplete search and clause generation: an application to the orienteering problems with time windows ⋮ Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ Integrating operations research in constraint programming ⋮ Integrating operations research in constraint programming ⋮ Bounding, filtering and diversification in CP-based local branching ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ New model and heuristics for safety stock placement in general acyclic supply chain networks ⋮ A unified framework for partial and hybrid search methods in constraint programming ⋮ Neighborhood portfolio approach for local search applied to timetabling problems ⋮ Vehicle routing problem with time windows and a limited number of vehicles. ⋮ Hybridizing exact methods and metaheuristics: a taxonomy
This page was built for publication: A constraint programming framework for local search methods
