An exact algorithm for IP column generation
暂无分享,去创建一个
[1] Jacques Desrosiers,et al. Time Constrained Routing and Scheduling , 1992 .
[2] Laurence A. Wolsey,et al. Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms , 1998, Oper. Res..
[3] George L. Nemhauser,et al. Solving binary cutting stock problems by column generation and branch-and-bound , 1994, Comput. Optim. Appl..
[4] Karen Aardal,et al. Polyhedral Techniques in Combinatorial Optimization , 1995 .
[5] George B. Dantzig,et al. Decomposition Principle for Linear Programs , 1960 .
[6] Anthony Wren,et al. Computer Scheduling of Public Transportation: Urban Passenger Vehicle and Crew Scheduling , 1981 .
[7] A. A. Farley. A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems , 1990, Oper. Res..
[8] George L. Nemhauser,et al. Min-cut clustering , 1993, Math. Program..
[9] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .
[10] Martin W. P. Savelsbergh,et al. A Branch-and-Price Algorithm for the Generalized Assignment Problem , 1997, Oper. Res..
[11] Ralph E. Gomory,et al. A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .
[12] M. Minoux. A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations , 1987 .
[13] Leon S. Lasdon,et al. Optimization Theory of Large Systems , 1970 .