New Bundle Methods for Solving Lagrangian Relaxation Dual Problems
暂无分享,去创建一个
[1] P. B. Coaker,et al. Applied Dynamic Programming , 1964 .
[2] R. Bellman. Dynamic programming. , 1957, Science.
[3] Philip Wolfe,et al. Validation of subgradient optimization , 1974, Math. Program..
[4] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.
[5] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[6] J. Hiriart-Urruty,et al. Convex analysis and minimization algorithms , 1993 .
[7] Krishna R. Pattipati,et al. A practical approach to job-shop scheduling problems , 1993, IEEE Trans. Robotics Autom..
[8] Dimitri P. Bertsekas,et al. Nonlinear Programming , 1997 .
[9] Krzysztof C. Kiwiel,et al. Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities , 1995, Math. Program..
[10] Krzysztof C. Kiwiel,et al. Restricted Step and Levenberg-Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization , 1996, SIAM J. Optim..
[11] Niklas Kohl,et al. An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation , 1997, Oper. Res..
[12] Peter B. Luh,et al. An optimization-based algorithm for job shop scheduling , 1997 .
[13] Defeng Sun,et al. Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization , 1998, SIAM J. Optim..
[14] M. Caramanis,et al. Efficient Lagrangian relaxation algorithms for industry size job-shop scheduling problems , 1998 .