Fisher, Marshall L. The Lagrangian relaxation method for solving integer programming problems. (English) Zbl 0539.90079 IIASA Collab. Proc. Ser. CP-81-S1, 581-616 (1981). Summary: An identical version of this article was published in Manage. Sci. 27, 1- 18 (1981; Zbl 0466.90054). Cited in 7 Documents MSC: 90C10 Integer programming 65K05 Numerical mathematical programming methods 90-02 Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming 90B35 Deterministic scheduling theory in operations research 05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) Keywords:bounds; branch and bound algorithm; routing; location; scheduling; assignment; set covering; Lagrangian relaxation Citations:Zbl 0466.90054 PDFBibTeX XML