Local search-based hybrid algorithms for finding Golomb rulers

DOI10.1007/S10601-007-9020-1zbMATH Open1211.90194OpenAlexW2019034008MaRDI QIDQ2385176FDOQ2385176

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

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

zbMATH Keywords

clusteringlocal searchconstraint programmingevolutionary algorithmstabu searchGolomb rulers

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

• 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
• Application of Bat-Inspired Computing Algorithm and Its Variants in Search of Near-Optimal Golomb Rulers for WDM Systems: A Comparative Study
• Exploiting a hypergraph model for finding Golomb rulers
• Evolutionary Computation in Combinatorial Optimization
• Genetic search for Golomb arrays
• Nature-inspired metaheuristic algorithms to find near-OGR sequences for WDM channel allocation and their performance comparison

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)