Exploiting relaxation in local search for LABS
From MaRDI portal
Publication:2468767
DOI10.1007/s10479-007-0226-9zbMath1145.90059OpenAlexW1995280359MaRDI QIDQ2468767
Publication date: 25 January 2008
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-007-0226-9
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (3)
Exhaustive Search for Optimal Minimum Peak Sidelobe Binary Sequences up to Length 80 ⋮ The Relation Between Complete and Incomplete Search ⋮ Toward unification of exact and heuristic optimization methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- Coloration neighbourhood search with forward checking
- Local search with constraint propagation and conflict-based heuristics
- Combining the scalability of local search with the pruning techniques of systematic search
- Negative effects of modeling techniques on search performance
- Incomplete dynamic backtracking for linear pseudo-Boolean problems
- Low autocorrelation binary sequences: exact enumeration and optimization by evolutionary strategies
- Exhaustive search for low-autocorrelation binary sequences
- On the ground states of the Bernasconi model
- Symmetry Breaking and Local Search Spaces
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: Exploiting relaxation in local search for LABS
