Lagrangian Relax-and-Cut Algorithms

Abilio Lucena ()
Additional contact information
Abilio Lucena: Universidade Federal do Rio de Janeiro, Departamento de Administração

Chapter 5 in Handbook of Optimization in Telecommunications, 2006, pp 129-145 from Springer

Abstract: Abstract Attempts to allow exponentially many inequalities to be candidates to Lagrangian dualization date from the early 1980s. In the literature, the term Relax-and-Cut is being used to denote the whole class of Lagrangian Relaxation algorithms where Lagrangian bounds are attempted to be improved by dynamically strengthening relaxations with the introduction of valid constraints (possibly selected from families with exponentially many constraints). In this chapter, Relax-and-Cut algorithms are reviewed in their two flavors. Additionally, a general framework to obtain feasible integral solutions (that benefit from Lagrangian bounds) is also presented. Finally, the use of Relax-and-Cut is demonstrated through an application to a hard-to-solve instance of the Knapsack Problem. For that application, Gomory cuts are used, for the first time, within a Lagrangian relaxation framework.

Keywords: Relax-and-cut; Lagrangian relaxation; cutting planes; knapsack problem (search for similar items in EconPapers)
Date: 2006
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-387-30165-5_5

Ordering information: This item can be ordered from
http://www.springer.com/9780387301655

DOI: 10.1007/978-0-387-30165-5_5

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().