Stabilization in Column Generation
暂无分享,去创建一个
[1] Krzysztof C. Kiwiel. A bundle Bregman proximal method for convex nondifferentiable minimization , 1999, Math. Program..
[2] Claude Lemaréchal,et al. Lagrangian Relaxation , 2000, Computational Combinatorial Optimization.
[3] Sebastian Stiller,et al. Network Models , 2004, Network Analysis.
[4] J. Hiriart-Urruty,et al. Convex analysis and minimization algorithms , 1993 .
[5] Jonathan Eckstein,et al. Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming , 1993, Math. Oper. Res..
[6] Jacques Desrosiers,et al. A Column Generation Approach for Large-Scale Aircrew Rostering Problems , 1999, Oper. Res..
[7] Giorgio Gallo,et al. A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems , 1999, INFORMS J. Comput..
[8] Yurii Nesterov,et al. New variants of bundle methods , 1995, Math. Program..
[9] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .
[10] Pierre Hansen,et al. Stabilized column generation , 1998, Discret. Math..
[11] Jean-Philippe Vial,et al. Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method , 2002, Optim. Methods Softw..
[12] R. E. Marsten,et al. The Boxstep Method for Large-Scale Optimization , 2011, Oper. Res..
[13] Jacques Desrosiers,et al. Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems , 1998, Transp. Sci..
[14] Celso C. Ribeiro,et al. A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem , 1991, Oper. Res..
[15] Antonio Frangioni,et al. Solving semidefinite quadratic problems within nonsmooth optimization algorithms , 1996, Comput. Oper. Res..
[16] Teodor Gabriel Crainic,et al. Bundle-based relaxation methods for multicommodity capacitated fixed charge network design , 2001, Discret. Appl. Math..
[17] R. Rockafellar. Monotone Operators and the Proximal Point Algorithm , 1976 .
[18] Mustafa Ç. Pinar,et al. On Smoothing Exact Penalty Functions for Convex Constrained Optimization , 1994, SIAM J. Optim..
[19] Albert P. M. Wagelmans,et al. An Overview of Models and Techniques for Integrating Vehicle and Crew Scheduling , 1997 .
[20] R. P. Harvey. The decomposition principle for linear programs , 1964 .
[21] Antonio Frangioni,et al. Generalized Bundle Methods , 2002, SIAM J. Optim..
[22] Marc Teboulle,et al. Entropy-Like Proximal Methods in Convex Programming , 1994, Math. Oper. Res..
[23] Jochem Zowe,et al. A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results , 1992, SIAM J. Optim..
[24] François Soumis,et al. A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem , 2001, Oper. Res..
[25] Leonid Khachiyan,et al. An exponential-function reduction method for block-angular convex programs , 1995, Networks.
[26] Jun-Yeon Lee,et al. A descent method with linear programming subproblems for nondifferentiable convex optimization , 1995, Math. Program..
[27] J. E. Kelley,et al. The Cutting-Plane Method for Solving Convex Programs , 1960 .
[28] Marc Teboulle,et al. Convergence of Proximal-Like Algorithms , 1997, SIAM J. Optim..
[29] Jacques Desrosiers,et al. A proximal trust-region algorithm for column generation stabilization , 2003, Comput. Oper. Res..