Gomory cuts revisited
暂无分享,去创建一个
Egon Balas | Gérard Cornuéjols | Sebastián Ceria | N. Natraj | E. Balas | G. Cornuéjols | S. Ceria | N. Natraj | Sebastián Ceria
[1] E. Balas,et al. Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework , 1996 .
[2] C. A. Trauth,et al. Integer Linear Programming: A Study in Computational Efficiency , 1969 .
[3] Giovanni Rinaldi,et al. A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..
[4] John D. C. Little,et al. On model building , 1993 .
[5] Egon Balas,et al. A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..
[6] Jan Karel Lenstra,et al. History of mathematical programming : a collection of personal reminiscences , 1991 .
[7] Ralph E. Gomory,et al. An algorithm for integer solutions to linear programs , 1958 .
[8] John Haldi,et al. A Computer Code for Integer Solutions to Linear Programs , 1965 .
[9] G. Ding. Discrete optimization , 1977 .
[10] Laurence A. Wolsey,et al. Solving Mixed Integer Programming Problems Using Automatic Reformulation , 1987, Oper. Res..
[11] Richard C. Larson,et al. Model Building in Mathematical Programming , 1979 .
[12] George L. Nemhauser,et al. Handbooks in operations research and management science , 1989 .
[13] R. Gomory. AN ALGORITHM FOR THE MIXED INTEGER PROBLEM , 1960 .
[14] P. Miliotis,et al. Using cutting planes to solve the symmetric Travelling Salesman problem , 1978, Math. Program..
[15] M. Padberg,et al. Solving airline crew scheduling problems by branch-and-cut , 1993 .
[16] G. Nemhauser,et al. Integer Programming , 2020 .
[17] Ellis L. Johnson,et al. Solving Large-Scale Zero-One Linear Programming Problems , 1983, Oper. Res..