Combining column generation and Lagrangian relaxation

31Citations
Citations of this article
52Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Although the possibility to combine column generation and Lagrangian relaxation has been known for quite some time, it has only recently been exploited in algorithms. In this paper, we discuss ways of combining these techniques. We focus on solving the LP relaxation of the Dantzig-Wolfe master problem. In a first approach we apply Lagrangian relaxation directly to this extended formulation, i.e. no simplex method is used. In a second one, we use Lagrangian relaxation to generate new columns, that is Lagrangian relaxation is applied to the compact formulation. We will illustrate the ideas behind these algorithms with an application in lot-sizing. To show the wide applicability of these techniques, we also discuss applications in integrated vehicle and crew scheduling, plant location and cutting stock problems. © 2005 Springer Science+Business Media, Inc.

Cite

CITATION STYLE

APA

Huisman, D., Jans, R., Peeters, M., & Wagelmans, A. P. M. (2005). Combining column generation and Lagrangian relaxation. In Column Generation (pp. 247–270). Springer US. https://doi.org/10.1007/0-387-25486-2_9

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