Bounding, filtering and diversification in CP-based local branching
From MaRDI portal
Publication:519096
DOI10.1007/s10732-011-9190-2zbMath1358.90158OpenAlexW2151566886MaRDI QIDQ519096
Michela Milano, Fabio Parisini, Zeynep Kiziltan, Andrea Lodi
Publication date: 4 April 2017
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-011-9190-2
local searchconstraint programmingdiversificationtraveling salesman problem with time windowscost-based filteringadditive bounding
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Model-based automatic neighborhood design by unsupervised learning, MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- Variable neighborhood search
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Local branching
- Exploring relaxation induced neighborhoods to improve MIP solutions
- A constraint programming framework for local search methods
- Constraint programming based Lagrangian relaxation for the automatic recording problem
- Optimization-oriented global constraints
- Cost-based arc consistency for global cardinality constraints
- Constraint and integer programming. Toward a unified methodology.
- New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows
- A Hybrid Exact Algorithm for the TSPTW
- An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions
- Constraint Programming and Local Search Hybrids
- CP-Based Local Branching
- Distributed Constraint-Based Local Search
- An Additive Bounding Procedure for Combinatorial Optimization Problems
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
