Combining the scalability of local search with the pruning techniques of systematic search
From MaRDI portal
Publication:1854753
DOI10.1023/A:1021140902684zbMath1013.90104OpenAlexW72011665MaRDI QIDQ1854753
Publication date: 27 January 2003
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1021140902684
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
Contraint-based combinators for local search, A constraint-based local search backend for MiniZinc, Hybrid Metaheuristics: An Introduction, Combining metaheuristics with mathematical programming, constraint programming and machine learning, Automated reformulation of specifications by safe delay of constraints, Local search with a SAT oracle for combinatorial optimization, About the choice of the variable to unassign in a decision repair algorithm, Generalised graph colouring by a hybrid of local search and constraint programming, Exploiting relaxation in local search for LABS, Combining metaheuristics with mathematical programming, constraint programming and machine learning, Switching among Solvers: Collaborative Algorithms with Parameter Control, An effective local search for the maximum clique problem, Hybrid metaheuristics for stochastic constraint programming
Uses Software
