Lagrangian Relaxation for Integer Programming

Geoffrion, Arthur M.

doi:10.1007/978-3-540-68279-0_9

Arthur M. Geoffrion⁹

8727 Accesses
6 Citations

Abstract

It is a pleasure to write this commentary because it offers an opportunity to express my gratitude to several people who helped me in ways that turned out to be essential to the birth of [8]. They also had a good deal to do with shaping my early career and, consequently, much of what followed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Chapter: USD 29.95; Price excludes VAT (USA)

eBook: USD 109.00; Price excludes VAT (USA)

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

References

E. Balas, An additive algorithm for solving linear programs with zero-one variables, Operations Research 13 (1965) 517–546.
Article MathSciNet Google Scholar
R. Brooks and A.M. Geoffrion, Finding Everett’s Lagrange multipliers by linear programming, Operations Research 14 (1966) 1149–1153.
Article MathSciNet Google Scholar
A.M. Geoffrion, Integer programming by implicit enumeration and Balas’ method, Review of the Society for Industrial and Applied Mathematics 9 (1967) 178–190.
MathSciNet MATH Google Scholar
A.M. Geoffrion, An improved implicit enumeration approach for integer programming, Operations Research 17 (1969) 437–454.
Article Google Scholar
A.M. Geoffrion, Elements of large-scale mathematical programming, Management Science 16 (1970) 652–691.
Article MathSciNet Google Scholar
A.M. Geoffrion, Duality in nonlinear programming, SIAM Review 13 (1971) 1–37.
Article MathSciNet Google Scholar
A.M. Geoffrion and G.W. Graves, Multicommodity distribution system design by Benders decomposition, Management Science 20 (1974) 822–844.
Article Google Scholar
A.M. Geoffrion, Lagrangean relaxation for integer programming, Mathematical Programming Study 2 (1974) 82–114.
Article MathSciNet Google Scholar

Download references

Author information

Authors and Affiliations

UCLA Anderson School of Management, Los Angeles, USA
Arthur M. Geoffrion

Authors

Arthur M. Geoffrion
View author publications
You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Arthur M. Geoffrion .

Editor information

Editors and Affiliations

Inst. Informatik, Universität Köln, Pohligstr. 1, Köln, 50969, Germany
Michael Jünger
Fac. Sciences de Base (FSB), Ecole Polytechnique Fédérale de Lausanne, Lausanne, 1015, Switzerland
Thomas M. Liebling
Ensimag, Institut Polytechnique de Grenoble, avenue Félix Viallet 46, Grenoble CX 1, 38031, France
Denis Naddef
School of Industrial &, Georgia Institute of Technology, Ferst Drive NW., 765, Atlanta, 30332-0205, USA
George L. Nemhauser
IBM Corporation, Route 100 294, Somers, 10589, USA
William R. Pulleyblank
Inst. Informatik, Universität Heidelberg, Im Neuenheimer Feld 326, Heidelberg, 69120, Germany
Gerhard Reinelt
ed Informatica, CNR - Ist. Analisi dei Sistemi, Viale Manzoni 30, Roma, 00185, Italy
Giovanni Rinaldi
Center for Operations Reserach &, Université Catholique de Louvain, voie du Roman Pays 34, Leuven, 1348, Belgium
Laurence A. Wolsey

Rights and permissions

Reprints and permissions

Copyright information

About this chapter

Cite this chapter

Geoffrion, A.M. (2010). Lagrangian Relaxation for Integer Programming. In: Jünger, M., et al. 50 Years of Integer Programming 1958-2008. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68279-0_9

Download citation

DOI: https://doi.org/10.1007/978-3-540-68279-0_9
Published: 06 November 2009
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68274-5
Online ISBN: 978-3-540-68279-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)

Publish with us

Policies and ethics