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

DOI10.1016/J.DAM.2005.07.006MaRDI QIDQ2581563zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

Cited in

(6)

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