{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T16:18:10Z","timestamp":1772036290213,"version":"3.50.1"},"reference-count":36,"publisher":"EDP Sciences","issue":"4","license":[{"start":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T00:00:00Z","timestamp":1723075200000},"content-version":"vor","delay-in-days":38,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2024,5,31]]},"published-print":{"date-parts":[[2024,7]]},"abstract":"<jats:p>In this paper, we provide a straightforward proof of a conjecture proposed in [P. Duxbury, C. Lavor and L.L. de Salles-Neto, <jats:italic>RAIRO:RO<\/jats:italic> 55 (2021) 2241\u20132246.] regarding the optimal solutions of a non-convex mathematical programming model of the Golomb ruler problem. Subsequently, we investigate the computational efficiency of four new binary mixed-integer linear programming models to compute optimal Golomb rulers. These models are derived from a well-known nonlinear integer model proposed in [B. Kocuk and W.-J. van Hoeve, A Computational Comparison of Optimization Methods for the Golomb Ruler Problem. (2019) 409\u2013425.], utilizing the reformulation-linearization technique. Finally, we provide the correct outputs of the greedy heuristic proposed in [P. Duxbury, C. Lavor and L.L. de Salles-Neto, <jats:italic>RAIRO:RO<\/jats:italic> 55 (2021) 2241\u20132246.] and correct false conclusions stated or implied therein.<\/jats:p>","DOI":"10.1051\/ro\/2024121","type":"journal-article","created":{"date-parts":[[2024,6,3]],"date-time":"2024-06-03T19:07:03Z","timestamp":1717441623000},"page":"3171-3188","source":"Crossref","is-referenced-by-count":2,"title":["Partial reformulation-linearization based optimization models for the Golomb ruler problem"],"prefix":"10.1051","volume":"58","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3707-6741","authenticated-orcid":false,"given":"Hac\u00e8ne","family":"Ouzia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2024,8,8]]},"reference":[{"key":"R1","unstructured":"AMPL Optimization Inc, AMPL. https:\/\/ampl.com (2023)."},{"key":"R2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1002\/j.1538-7305.1953.tb01422.x","volume":"32","author":"Babcock","year":"1953","journal-title":"Bell Syst. Tech. J."},{"key":"R3","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"Balas","year":"1993","journal-title":"Math. Program."},{"key":"R4","doi-asserted-by":"crossref","unstructured":"Basu S., Pollack R. and Roy M.-F., Algorithms in Real Algebraic Geometry. Springer Berlin Heidelberg (2006).","DOI":"10.1007\/3-540-33099-2"},{"key":"R5","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1109\/PROC.1977.10517","volume":"65","author":"Bloom","year":"1977","journal-title":"Proc. IEEE"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"Byrd R.H., Nocedal J. and Waltz R.A., Knitro: An Integrated Package for Nonlinear Optimization. (2006) 35\u201359.","DOI":"10.1007\/0-387-30065-1_4"},{"key":"R7","unstructured":"Cox D., Little J. and O\u2019Shea D., Using Algebraic Geometry, 2nd edition. Springer (2004)."},{"key":"R8","unstructured":"Dimitromanolakis A., Analysis of the golomb ruler and the sidon set problems, and determination of large, near-optimal golomb rulers. Master\u2019s thesis, Department of Electronic and Computer Engineering, Technical University of Crete (2002)."},{"key":"R9","doi-asserted-by":"crossref","unstructured":"Dot\u00fa I. and Van Hentenryck P., A simple hybrid evolutionary algorithm for finding golomb rulers. In Vol. 3 2005 IEEE Congress on Evolutionary Computation. IEEE (2005) 2018\u20132023.","DOI":"10.1109\/CEC.2005.1554943"},{"key":"R10","doi-asserted-by":"crossref","first-page":"235","DOI":"10.3934\/amc.2009.3.235","volume":"3","author":"Drakakis","year":"2009","journal-title":"Adv. Math. Commun."},{"key":"R11","doi-asserted-by":"crossref","unstructured":"Drakakis K., Gow R. and O\u2019Carroll L., On some properties of costas arrays generated via finite fields. In: 2006 40th Annual Conference on Information Sciences and Systems. IEEE (2006) 801\u2013805.","DOI":"10.1109\/CISS.2006.286576"},{"key":"R12","doi-asserted-by":"crossref","first-page":"2241","DOI":"10.1051\/ro\/2021103","volume":"55","author":"Duxbury","year":"2021","journal-title":"RAIRO:RO"},{"key":"R13","unstructured":"Galinier P., A Constraint-Based Approach to the Golomb Ruler Problem. Universit\u00e9 de Montr\u00e9al, Centre de recherche sur les transports (2003)."},{"key":"R14","unstructured":"Gurobi Optimization, LLC, Gurobi Optimizer Reference Manual. https:\/\/www.gurobi.com (2023)."},{"key":"R15","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/s12532-018-0138-5","volume":"10","author":"Khajavirad","year":"2018","journal-title":"Math. Program. Comput."},{"key":"R16","doi-asserted-by":"crossref","unstructured":"Kocuk B. and van Hoeve W.-J., A Computational Comparison of Optimization Methods for the Golomb Ruler Problem. (2019) 409\u2013425.","DOI":"10.1007\/978-3-030-19212-9_27"},{"key":"R17","doi-asserted-by":"crossref","unstructured":"Lasserre J.B., An Explicit Exact sdp Relaxation for Nonlinear 0\u20131 Programs. (2001) 293\u2013303.","DOI":"10.1007\/3-540-45535-3_23"},{"key":"R18","doi-asserted-by":"crossref","unstructured":"Liu T. and Luo C., The proof of a conjecture for a continuos golumb ruler model. DOI: https:\/\/doi.org\/10.20944\/preprints202211.0027.v2 (2022).","DOI":"10.20944\/preprints202211.0027.v1"},{"key":"R19","doi-asserted-by":"crossref","first-page":"1486","DOI":"10.1109\/18.133274","volume":"37","author":"Lorentzen","year":"1991","journal-title":"IEEE Trans. Inf. Theory"},{"key":"R20","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"Lov\u00e1sz","year":"1991","journal-title":"SIAM J. Optim."},{"key":"R21","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"McCormick","year":"1976","journal-title":"Math. Program."},{"key":"R22","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.dam.2005.07.006","volume":"154","author":"Meyer","year":"2006","journal-title":"Discrete Appl. Math."},{"key":"R23","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1016\/j.dam.2008.07.006","volume":"157","author":"Meyer","year":"2009","journal-title":"Discrete Appl. Math."},{"key":"R24","doi-asserted-by":"crossref","first-page":"2031","DOI":"10.1016\/j.dam.2010.08.020","volume":"158","author":"Minoux","year":"2010","journal-title":"Discrete Appl. Math."},{"key":"R25","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1287\/moor.28.3.470.16391","volume":"28","author":"Monique","year":"2003","journal-title":"Math. Oper. Res."},{"key":"R26","doi-asserted-by":"crossref","first-page":"65482","DOI":"10.1109\/ACCESS.2021.3075877","volume":"9","author":"Ojeda","year":"2021","journal-title":"IEEE Access"},{"key":"R27","first-page":"1","volume":"2015","author":"Ouzia","year":"2015","journal-title":"Adv. Oper. Res."},{"key":"R28","unstructured":"Prestwich S., Trading completeness for scalability: Hybrid search for cliques and rulers. In: Proceedings of the Third International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. (2001) 159\u2013174."},{"key":"R29","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1287\/mnsc.36.5.519","volume":"36","author":"Fourer","year":"1990","journal-title":"Manag. Sci."},{"key":"R30","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1109\/TIT.1967.1053951","volume":"13","author":"Robinson","year":"1967","journal-title":"IEEE Trans. Inf. Theory"},{"key":"R31","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1109\/18.50388","volume":"36","author":"Shearer","year":"1990","journal-title":"IEEE Trans. Inf. Theory"},{"key":"R32","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"Sherali","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"R33","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0166-218X(92)00190-W","volume":"52","author":"Sherali","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"R34","doi-asserted-by":"crossref","unstructured":"Slusky M.R. and van Hoeve W.-J., A Lagrangian Relaxation for Golomb Rulers. (2013) 251\u2013267.","DOI":"10.1007\/978-3-642-38171-3_17"},{"key":"R35","unstructured":"Smith B.M., Stergiou K. and Walsh T., Using auxiliary variables and implied constraints to model non-binary problems. In: Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence. AAAI Press (2000) 182\u2013187."},{"key":"R36","unstructured":"Soliday S.W., Homaifar A. and Lebby G.L., Genetic algorithm approach to the search for golomb rulers. In: ICGA. (1995) 528\u2013535."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2024121\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T12:02:42Z","timestamp":1723204962000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2024121"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7]]},"references-count":36,"journal-issue":{"issue":"4"},"alternative-id":["ro240128"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2024121","relation":{},"ISSN":["0399-0559","2804-7303"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"2804-7303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7]]}}}