Skip to main content
Conference Proceedings

Lagrangian relaxation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2241 112-156
DOI: 10.1007/3-540-45586-8_4
158Citations
Citations of this article
199Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Lagrangian relaxation is a tool to find upper bounds on a given (arbitrary) maximization problem. Sometimes, the bound is exact and an optimal solution is found. Our aim in this paper is to review this technique, the theory behind it, its numerical aspects, its relation with other techniques such as column generation.

Cite

CITATION STYLE

APA

Lemaréchal, C. (2001). Lagrangian relaxation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2241, pp. 112–156). Springer Verlag. https://doi.org/10.1007/3-540-45586-8_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free