A Lagrangian Relaxation for Golomb Rulers

DOI10.1007/978-3-642-38171-3_17zbMath1382.68233OpenAlexW42061387MaRDI QIDQ4922916

Willem-Jan van Hoeve, M. Slusky

Publication date: 4 June 2013

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38171-3_17

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

A Lagrangian propagator for artificial neural networks in constraint programming ⋮ New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach

This page was built for publication: A Lagrangian Relaxation for Golomb Rulers