A Lagrangean dual-based solution method for a special linear programming problem
References (7)
- et al.
A branch-and-bound algorithm for the generalized assignment problem
Math. Progr.
(1975) - et al.
A multiplier adjustment method for the generalized assignment problem
The Lagrangian relaxation method for solving integer programming problems
Mgmt Sci.
(1981)
Cited by (0)
- ∗
Mark Karwan is Professor of Industrial Engineering at the State University of New York at Buffalo. He received the B.E.S. and M.S.E. degrees from Johns Hopkins University and the Ph.D. from the Georgia Institute of Technology. Dr Karwan's research interests are in discrete optimization, multiple criteria decision making and multilevel systems. He has published articles in Operations Research, Management Science, Mathematical Programming, Naval Research Logistics Quarterly and other professional journals.
- †
Balasubramanian Ram is an Assistant Professor in the Department of Industrial Engineering at North Carolina Agricultural and Technical State University, Greensboro. He received his B.S. (Mechanical Engineering) and M.S. degrees (Industrial Engineering) from IIT Madras and obtained his Ph.D. in Industrial Engineering from the State University of New York at Buffalo. His research interests are in mathematical programming, production planning and information systems.