Hybrid Benders Decomposition Algorithms in Constraint Logic Programming
暂无分享,去创建一个
[1] Stefan E. Karisch,et al. A Framework for Constraint Programming Based Column Generation , 1999, CP.
[2] Nicolas Beldiceanu,et al. Introducing global constraints in CHIP , 1994 .
[3] Leif H. Appelgren,et al. A Column Generation Algorithm for a Ship Scheduling Problem , 1969 .
[4] Gilbert Laporte,et al. Optimal sizes of facilities on a linear market , 1989 .
[5] Cid C. de Souza,et al. A Hybrid Approach for Solving Large Scale Crew Scheduling Problems , 2000, PADL.
[6] J. Hooker,et al. Logic-based Benders decomposition , 2003 .
[7] Ralph E. Gomory,et al. An algorithm for integer solutions to linear programs , 1958 .
[8] George B. Dantzig,et al. Linear programming and extensions , 1965 .
[9] Mark Wallace,et al. Probe Backtrack Search for Minimal Perturbation in Dynamic Scheduling , 2000, Constraints.
[10] T. Benoist,et al. Lagrange Relaxation and Constraint Programming Collaborative schemes for Traveling Tournament Problems , 2001 .
[11] J. F. Benders. Partitioning procedures for solving mixed-variables programming problems , 1962 .