Local search-based hybrid algorithms for finding Golomb rulers

DOI10.1007/S10601-007-9020-1MaRDI QIDQ2385176zbMATHOpenAlexFDO

Authors A. J. Fernández, Pascal Van Hentenryck, Carlos Cotta, Ivan Dotu

Publication date 11 October 2007

Published in Constraints (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10601-007-9020-1

zbMATH Keywords

clusteringlocal searchconstraint programmingevolutionary algorithmstabu searchGolomb rulers

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• Constraint-based local search for Golomb rulers
• Evolutionary Computation in Combinatorial Optimization
• A tabu search algorithm for difference triangle sets and Golomb rulers
• A Lagrangian Relaxation for Golomb Rulers
• A conjecture on a continuous optimization model for the Golomb ruler problem

Cites work

• scientific article; zbMATH DE number 20220 (Why is no real title available?)
• scientific article; zbMATH DE number 44281 (Why is no real title available?)
• scientific article; zbMATH DE number 2050708 (Why is no real title available?)
• scientific article; zbMATH DE number 2159378 (Why is no real title available?)
• scientific article; zbMATH DE number 3340881 (Why is no real title available?)
• A Gentle Introduction to Memetic Algorithms
• A class of binary recurrent codes with limited error propagation
• A new adaptive multi-start technique for combinatorial global optimizations
• A new algorithm for Golomb ruler derivation and proof of the 19 mark ruler
• Bounds and construction for difference triangle sets
• Embedding branch and bound within evolutionary algorithms
• Evolutionary Computation in Combinatorial Optimization
• Evolutionary Computation in Combinatorial Optimization
• Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Greedy randomized adaptive search procedures
• Landscapes, operators and heuristic search
• Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
• Scatter search. Methodology and implementation in C. With CD-ROM.
• Tabu Search—Part I
• Tabu Search—Part II
• There Are No New Homometric Golomb Ruler Pairs with 12 Marks or Less

Cited in

(9)

• Exploiting a hypergraph model for finding Golomb rulers
• Constraint-based local search for Golomb rulers
• A tabu search algorithm for difference triangle sets and Golomb rulers
• Exploiting a Hypergraph Model for Finding Golomb Rulers
• Redundant modeling in permutation weighted constraint satisfaction problems
• Genetic search for Golomb arrays
• Nature-inspired metaheuristic algorithms to find near-OGR sequences for WDM channel allocation and their performance comparison
• Application of bat-inspired computing algorithm and its variants in search of near-optimal Golomb rulers for WDM systems: a comparative study
• Evolutionary Computation in Combinatorial Optimization

Describes a project that uses

Uses Software

• Scatter Search
• Prolog

This page was built for publication: Local search-based hybrid algorithms for finding Golomb rulers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2385176)