Partial reformulation-linearization based optimization models for the Golomb ruler problem

DOI10.1051/RO/2024121MaRDI QIDQ6658434zbMATH OpenFDO

Authors Hacene Ouzia

Publication date 8 January 2025

Published in RAIRO. Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1051/RO/2024121

zbMATH Keywords

quadratic programmingmixed integer linear programminginteger nonlinear programmingreformulation-linearization techniquesGolomb ruler problem

Mathematics Subject Classification ID

Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27) Nonlinear programming (90C30) Integer programming (90C10) Mixed integer programming (90C11)

Recommendations

• A conjecture on a continuous optimization model for the Golomb ruler problem
• A computational comparison of optimization methods for the Golomb ruler problem
• Equivalence of some LP-based lower bounds for the Golomb ruler problem
• A Lagrangian Relaxation for Golomb Rulers
• Constraint-based local search for Golomb rulers

Cites work

• scientific article; zbMATH DE number 1757962 (Why is no real title available?)
• scientific article; zbMATH DE number 5066287 (Why is no real title available?)
• A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• A Lagrangian Relaxation for Golomb Rulers
• A Modeling Language for Mathematical Programming
• A class of binary recurrent codes with limited error propagation
• A computational comparison of optimization methods for the Golomb ruler problem
• A conjecture on a continuous optimization model for the Golomb ruler problem
• A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
• A hybrid LP/NLP paradigm for global optimization relaxations
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• A review of the available construction methods for Golomb rulers
• Algorithms in real algebraic geometry
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Cones of Matrices and Set-Functions and 0–1 Optimization
• DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips
• Equivalence of some LP-based lower bounds for the Golomb ruler problem
• On the complexity of constructing Golomb rulers
• Two new reformulation convexification based hierarchies for 0-1 MIPs

Cited in

(1)

• A continuous nonlinear optimization perspective on the spin glass problem

This page was built for publication: Partial reformulation-linearization based optimization models for the Golomb ruler problem

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