Local search-based hybrid algorithms for finding Golomb rulers
From MaRDI portal
Publication:2385176
DOI10.1007/s10601-007-9020-1zbMath1211.90194MaRDI QIDQ2385176
Pascal Van Hentenryck, Antonio J. Fernández, 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
clustering; tabu search; local search; evolutionary algorithms; constraint programming; Golomb rulers
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
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, Nature-inspired metaheuristic algorithms to find near-OGR sequences for WDM channel allocation and their performance comparison, Redundant modeling in permutation weighted constraint satisfaction problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Landscapes, operators and heuristic search
- A new adaptive multi-start technique for combinatorial global optimizations
- Embedding branch and bound within evolutionary algorithms
- Greedy randomized adaptive search procedures
- Scatter search. Methodology and implementation in C. With CD-ROM.
- Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
- Tabu Search—Part I
- Tabu Search—Part II
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- A new algorithm for Golomb ruler derivation and proof of the 19 mark ruler
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- A Gentle Introduction to Memetic Algorithms
- There Are No New Homometric Golomb Ruler Pairs with 12 Marks or Less
- A class of binary recurrent codes with limited error propagation
- Evolutionary Computation in Combinatorial Optimization
- Bounds and construction for difference triangle sets
- Evolutionary Computation in Combinatorial Optimization