CP-based local branching

Authors:
Zeynep Kiziltan;Andrea Lodi;Michela Milano;Fabio Parisini
Affiliations:
Computer Science Dep., University of Bologna, Italy;D.E.I.S., University of Bologna, Italy;D.E.I.S., University of Bologna, Italy;D.E.I.S., University of Bologna, Italy
Venue:
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Year:
2007

Citing 3
Cited 8

Optimization-Oriented Global Constraints

Constraints
A Hybrid Exact Algorithm for the TSPTW

INFORMS Journal on Computing
Limited discrepancy search

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

Discrepancy-based sliced neighborhood search

AIMSA'10 Proceedings of the 14th international conference on Artificial intelligence: methodology, systems, and applications
Improving CP-based local branching via sliced neighborhood search

Proceedings of the 2011 ACM Symposium on Applied Computing
Hybrid metaheuristics in combinatorial optimization: A survey

Applied Soft Computing
Climbing depth-bounded adjacent discrepancy search for solving hybrid flow shop scheduling problems with multiprocessor tasks

CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Sliced Neighborhood Search

Expert Systems with Applications: An International Journal
Bounding, filtering and diversification in CP-based local branching

Journal of Heuristics
DOE-based parameter tuning for local branching algorithm

International Journal of Metaheuristics
Improved bounds for hybrid flow shop scheduling with multiprocessor tasks

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Local branching is a general purpose heuristic search method successfully used in Mixed Integer Programming (MIP). We propose its integration and extension in Constraint Programming (CP).