Equivalence of some LP-based lower bounds for the Golomb ruler problem

DOI10.1016/J.DAM.2005.07.006zbMATH Open1091.05010OpenAlexW1988776662MaRDI QIDQ2581563FDOQ2581563

Authors: Christophe Meyer, Brigitte Jaumard 

Publication date: 10 January 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.07.006

Recommendations

• A Lagrangian Relaxation for Golomb Rulers
• A conjecture on a continuous optimization model for the Golomb ruler problem
• Constraint-based local search for Golomb rulers
• On the complexity of constructing Golomb rulers
• Lower bounds based on linear programming for the quadratic assignment problem

zbMATH Keywords

Golomb rulerLinear programmingLower boundDifference triangle sets

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Other designs, configurations (05B30)

Cites Work

• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Disjoint difference sets, difference triangle sets, and related codes
• Further results on difference triangle sets
• An approach to nonlinear programming
• Numbered complete graphs, unusual rulers, and assorted applications
• Title not available (Why is that?)
• On lower bounds for numbered complete graphs
• A new algorithm for Golomb ruler derivation and proof of the 19 mark ruler
• Title not available (Why is that?)
• Optimal recovery schemes in fault tolerant distributed computing
• Bounds and construction for difference triangle sets
• Equivalence of some LP-based lower bounds for the Golomb ruler problem
• Improved LP lower bounds for difference triangle sets
• A tabu search algorithm for difference triangle sets and Golomb rulers

Cited In (6)

• The ``point goalie problem
• A Lagrangian Relaxation for Golomb Rulers
• On the complexity of constructing Golomb rulers
• Partial reformulation-linearization based optimization models for the Golomb ruler problem
• A conjecture on a continuous optimization model for the Golomb ruler problem
• Equivalence of some LP-based lower bounds for the Golomb ruler problem

This page was built for publication: Equivalence of some LP-based lower bounds for the Golomb ruler problem

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