Skip navigation
Skip navigation

Constraint-based lagrangian relaxation

Fontaine, Daniel; Michel, Laurent; Van Hentenryck, Pascal


This paper studies how to generalize Lagrangian relaxation to high-level optimization models, including constraint-programming and local search models. It exploits the concepts of constraint violation (typically used in constraint programming and local search) and constraint satisfiability (typically exploited in mathematical programming). The paper considers dual and primal methods, studies their properties, and discusses how they can be implemented in terms of high-level model combinators and...[Show more]

CollectionsANU Research Publications
Date published: 2014
Type: Conference paper
Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
DOI: 10.1007/978-3-319-10428-7_25


File Description SizeFormat Image
01_Fontaine_Constraint-based_lagrangian_2014.pdf311.32 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator