Cutting Planes from Wide Split Disjunctions
暂无分享,去创建一个
[1] William J. Cook,et al. Chvátal closures for mixed integer programming problems , 1990, Math. Program..
[2] Ivana Ljubic,et al. ILP and CP Formulations for the Lazy Bureaucrat Problem , 2015, CPAIOR.
[3] Marco E. Lübbecke,et al. A Branch-and-Price Algorithm for Multi-mode Resource Leveling , 2010, SEA.
[4] Egon Balas,et al. Intersection Cuts - A New Type of Cutting Planes for Integer Programming , 1971, Oper. Res..
[5] Kent Andersen,et al. Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts , 2005, Manag. Sci..
[6] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .
[7] Sven Wiese,et al. On the interplay of Mixed Integer Linear, Mixed Integer Nonlinear and Constraint Programming , 2016 .
[8] Ralph E. Gomory,et al. An algorithm for integer solutions to linear programs , 1958 .
[9] Egon Balas,et al. programming: Properties of the convex hull of feasible points * , 1998 .
[10] Kent Andersen,et al. Split closure and intersection cuts , 2002, Math. Program..
[11] S. Martello,et al. Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem , 1999 .
[12] Pierre Hansen,et al. A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows , 2014, Comput. Oper. Res..
[13] E. Balas,et al. Strengthening cuts for mixed integer programs , 1980 .