论文信息 - Trivial integer programs unsolvable by branch-and-bound - 字舞流文

Trivial integer programs unsolvable by branch-and-bound

Robert G. Jeroslow | R. Jeroslow

[1] Ralph E. Gomory,et al. An algorithm for integer solutions to linear programs , 1958 .

[2] John A. Tomlin,et al. Technical Note - An Improved Branch-and-Bound Method for Integer Programming , 1971, Oper. Res..

[3] R. J. Dakin,et al. A tree-search algorithm for mixed integer programming problems , 1965, Comput. J..

[4] E. Balas. An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .

[5] Egon Balas,et al. Discrete Programming by the Filter Method , 1967, Oper. Res..

[6] G. Ribiere,et al. Experiments in mixed-integer linear programming , 1971, Math. Program..

[7] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.

[8] A. Land,et al. An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.

[9] Robert G. Jeroslow,et al. On an Algorithm of Gomory , 1971 .

[10] G. Nemhauser,et al. Integer Programming , 2020 .

[11] F. Glover. A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem , 1965 .

[12] Robert G. Jeroslow,et al. The simplex algorithm with the pivot rule of maximizing criterion improvement , 1973, Discret. Math..

[13] Robert G. Jeroslow. On algorithms for discrete problems , 1974, Discret. Math..

[14] V. Klee,et al. HOW GOOD IS THE SIMPLEX ALGORITHM , 1970 .