Analysis of Lagrangian Lower Bounds for a Graph Partitioning Problem

Gajendra K. Adil
Gajendra K. Adil
Department of Mechanical and Industrial Engineering, University of Manitoba, Winnipeg, Canada
Search for more papers by this author
,
Jay B. Ghosh
Jay B. Ghosh
Faculty of Business Administration, Bilkent University, Ankara, Turkey
Search for more papers by this author

Gajendra K. Adil

Gajendra K. Adil

Department of Mechanical and Industrial Engineering, University of Manitoba, Winnipeg, Canada

Search for more papers by this author

,

Jay B. Ghosh

Faculty of Business Administration, Bilkent University, Ankara, Turkey

Search for more papers by this author

Published Online:1 Oct 1999https://doi.org/10.1287/opre.47.5.785

References

Ahmadi R. H., Tang C. S. An operation partitioning problem for automated assembly system design. Oper. Res. (1991) 39:824–835Link, Google Scholar
Fisher M. L. The Lagrangian relaxation method for solving integer programming problems. Management Sci. (1981) 27:1–18Link, Google Scholar
Garey M. R., Johnson D. S.Computers and Intractability (1979) (Freeman, New York) Google Scholar
Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1988) (Wiley, New York) Crossref, Google Scholar

cover image Operations Research

Volume 47, Issue 5

September-October 1999

Pages 651-794

Article Information

Metrics

Information

Published Online:October 01, 1999

© 1999 INFORMS

Cite as

Gajendra K. Adil, Jay B. Ghosh, (1999) Analysis of Lagrangian Lower Bounds for a Graph Partitioning Problem. Operations Research 47(5):785-788.

https://doi.org/10.1287/opre.47.5.785

Keywords