Comments on “The Lagrangian Relaxation Method for Solving Integer Programming Problems”

References

• Bass F. M. New product growth for model consumer durables. Management Sci. (1969) 15(5):215–227Link, Google Scholar
• Batra P. Modeling and efficient optimization for object-based scalability and some related problems. IEEE Trans. Image Processing (2000) 9(10):1677–1692Crossref, Google Scholar
• Bell W. J., Dalberto L. M., Fisher M. L., Greenfield A. J., Jaikumar R., Kedia P., Mack R. G., Prutzman P. J. Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer. Interfaces (1983) 13(6):4–23Link, Google Scholar
• Caprara A., Carr T., Istrail S. 1001 optimal PDB structure alignments: Integer programming methods for finding the maximum contact map overlap. J. Comput. Biology (2004) 11(1):27–52Crossref, Google Scholar
• Cornuejols G., Fisher M. L., Nemhauser G. L. Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms. Exceptional paper. Management Sci. (1977) 23(8):789–810Link, Google Scholar
• Dantzig G. B., Wolfe P. The decomposition algorithm for linear programs. Econometrica (1961) 29(4):767–778Crossref, Google Scholar
• Feo T. A., Hochbaum D. S. Lagrangian relaxation for testing infeasibility in VLSI routing (in OR practice). Oper. Res. (1986) 34(6):819–831Link, Google Scholar
• Fisher M. L. Optimal solution of scheduling problems using Lagrange multipliers: Part I. Oper. Res. (1973a) 21(5):1114–1127Link, Google Scholar
• Fisher M. L. Optimal solution of scheduling problems using Lagrange multipliers: Part II. Invited paper. Proc. Sympos. Theory Scheduling Appl. (1973b) (Springer-Verlag)Crossref, Google Scholar
• Fisher M. L. A dual algorithm for the one-machine scheduling problem. Math. Programming (1976) 11(3):229–251Crossref, Google Scholar
• Fisher M. L. Lagrangian relaxation methods for combinatorial optimization. Proc. Summer School Combinatorial Optim. (1978) (Urbino, Italy) . (July 10–21)Google Scholar
• Fisher M. L. The Lagrangian relaxation method for solving integer programming problems. Management Sci. (1981) 27(1):1–18Link, Google Scholar
• Fisher M. L. An applications oriented guide to Lagrangian relaxation. Interfaces (1985) 15(2):10–21Link, Google Scholar
• Fisher M. L. Optimal solution of vehicle routing problems using minimum K-trees. Oper. Res. (1994) 42(4):626–642Link, Google Scholar
• Fisher M. L., Shapiro J. F. Constructive duality in integer programming. SIAM Appl. Math. (1974) 27(1):31–52Crossref, Google Scholar
• Geoffrion A. M. Lagrangian relaxation and its uses in integer programming. Math. Programming Stud. (1974) 2:82–114Crossref, Google Scholar
• Held M., Karp R. M. Traveling-salesman problem and minimum spanning trees. Oper. Res. (1970) 18(6):1138–1162Link, Google Scholar
• Hoganson H. M., Borges J. G. Impacts of the time horizon for adjacency constraints in harvest scheduling. Forest Sci. (2000) 46(2):176–187Google Scholar
• Hwang T. K., Chang S. C. Design of a Lagrangian relaxation-based hierarchical production scheduling environment for semiconductor wafer fabrication. IEEE Trans. Robotics Automation (2003) 19(4):566–578Crossref, Google Scholar
• Menon S., Amiri A. Scheduling banner advertisements on the Web. Informs J. Comput. (2004) 16(1):95–105Link, Google Scholar
• Ongsakul W., Petcharaks N. Unit commitment by enhanced adaptive Lagrangian relaxation. IEEE Transactions Power Systems (2004) 19(1):620–628Crossref, Google Scholar
• van den Heever S. A., Grossmann I. E. A strategy for the integration of production planning and reactive scheduling in the optimization of a hydrogen supply network. Comput. Chemical Engrg. (2004) 27(12):1813–1839Crossref, Google Scholar
• van den Heever S. A., Grossmann I. E., Vasantharajan S. Lagrangean decomposition heuristic for the design and planning of offshore hydrocarbon field infrastructures with complex economic objectives. Indust. Engrg. Chemistry Res. (2001) 40(13):2857–2875Crossref, Google Scholar