Lagrangean decomposition using an improved Nelder-Mead approach for Lagrangean multiplier update

[1]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .

[2]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[3]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[4]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[5]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[6]  A. M. Geoffrion.  Lagrangean Relaxation and Its Uses in Integer Programming , 1972 .

[7]  Marshall L. Fisher,et al.  Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I , 1973, Oper. Res..

[8]  Claude Lemaréchal,et al.  An Algorithm for Minimizing Convex Functions , 1974, IFIP Congress.

[9]  J. Krarup,et al.  Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem , 1977 .

[10]  Donald Erlenkotter,et al.  A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

[11]  Dorit S. Hochbaum,et al.  Database Location in Computer Networks , 1980, JACM.

[12]  S. Graves.  Using Lagrangean Techniques to Solve Hierarchical Production Planning Problems , 1982 .

[13]  V. F. Dem'yanov,et al.  Nondifferentiable Optimization , 1985 .

[14]  L Van Wassenhove,et al.  Lagrangean Relaxation for the Multi-Item Capacitated Lot-Sizing Problem , 1985 .

[15]  Monique Guignard-Spielberg,et al.  Lagrangean decomposition: A model yielding stronger lagrangean bounds , 1987, Math. Program..

[16]  M. Fisher,et al.  Optimal solution of set covering/partitioning problems using dual heuristics , 1990 .

[17]  Monique Guignard-Spielberg,et al.  An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem , 1990, Networks.

[18]  Krishan Rana,et al.  Routing Container Ships Using Lagrangean Relaxation and Decomposition , 1991, Transp. Sci..

[19]  Harish C. Bahl,et al.  A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing , 1992 .

[20]  S. Orero.  A combination of the genetic algorithm and Lagrangian relaxation decomposition techniques for the generation unit commitment problem , 1997 .

[21]  G. Gallo,et al.  A combined transportation and scheduling problem , 1997 .

[22]  B. Pelegrín,et al.  The return plant location problem: Modelling and resolution , 1998 .

[23]  C. Floudas,et al.  Effective Continuous-Time Formulation for Short-Term Scheduling. 1. Multipurpose Batch Processes , 1998 .

[24]  Carl Tim Kelley,et al.  Iterative methods for optimization , 1999, Frontiers in applied mathematics.

[25]  C. Maranas,et al.  A Hierarchical Lagrangean Relaxation Procedure for Solving Midterm Planning Problems , 1999 .

[26]  M. Guignard.  Lagrangean relaxation , 2003 .

[27]  Dan Wu,et al.  Decomposition approaches for the efficient solution of short-term scheduling problems , 2003, Comput. Chem. Eng..

[28]  George B. Dantzig,et al.  Linear Programming Under Uncertainty , 2004, Manag. Sci..

[29]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..

[30]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..