BoxStep methods for crew pairing problems
暂无分享,去创建一个
[1] Claude Lemaréchal,et al. Lagrangian Relaxation , 2000, Computational Combinatorial Optimization.
[2] Jacques Desrosiers,et al. Chapter 2 Time constrained routing and scheduling , 1995 .
[3] J. Hiriart-Urruty,et al. Convex analysis and minimization algorithms , 1993 .
[4] Martin W. P. Savelsbergh,et al. Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..
[5] R. E. Marsten,et al. The Boxstep Method for Large-Scale Optimization , 2011, Oper. Res..
[6] Jacques Desrosiers,et al. A proximal trust-region algorithm for column generation stabilization , 2003, Comput. Oper. Res..
[7] Victoria Chen,et al. A least-squares primal-dual algorithm for solving linear programming problems , 2002, Oper. Res. Lett..
[8] Cid C. de Souza,et al. A Hybrid Approach for Solving Large Scale Crew Scheduling Problems , 2000, PADL.
[9] Jing Hu,et al. Computational results with a primal-dual subproblem simplex method , 1999, Oper. Res. Lett..
[10] J. Goffin,et al. Cutting planes and column generation techniques with the projective algorithm , 1990 .
[11] Pierre Hansen,et al. Stabilized column generation , 1998, Discret. Math..
[12] Michel Van Caneghem,et al. Solving Crew Scheduling Problems bu Constraint Programming , 1995, CP.
[13] J. E. Kelley,et al. The Cutting-Plane Method for Solving Convex Programs , 1960 .
[14] Tomas Gustafsson. A Heuristic approach to column generation for Airline crew scheduling , 1999 .