Polyhedral annexation in mixed integer and combinatorial programming
暂无分享,去创建一个
[1] Egon Balas,et al. THE INTERSECTION CUT - A NEW CUTTING PLANE FOR INTEGER PROGRAMMING. , 1969 .
[2] R. J. Dakin,et al. A tree-search algorithm for mixed integer programming problems , 1965, Comput. J..
[3] Claude-Alain Burdet. Polaroids: A new tool in non‐convex and in integer programming , 1973 .
[4] Fred W. Glover,et al. The Disjunctive-Facet Problem: Formulation and Solution Techniques , 1974, Oper. Res..
[5] Claude Alain Burdet. Convex and polaroid extensions , 1977 .
[6] Fred W. Glover. Convexity cuts for multiple choice problems , 1973, Discret. Math..
[7] R. Gomory. AN ALGORITHM FOR THE MIXED INTEGER PROBLEM , 1960 .
[8] Ellis L. Johnson,et al. Some continuous functions related to corner polyhedra , 1972, Math. Program..
[9] Fred W. Glover,et al. Convexity Cuts and Cut Search , 1973, Oper. Res..
[10] R. Gomory. Some polyhedra related to combinatorial problems , 1969 .
[11] Egon Balas,et al. Integer programming and convex analysis: Intersection cuts from outer polars , 1972, Math. Program..
[12] Fred W. Glover,et al. The Generalized Lattice-Point Problem , 1973, Oper. Res..
[13] Fred Glover,et al. Inequalities for mixed integer programs with structure , 1976 .
[14] G. Owen. Cutting planes for programs with disjunctive constraints , 1973 .
[15] R. D. Young. Hypercylindrically Deduced Cuts in Zero-One Integer Programs , 1971, Oper. Res..
[16] Egon Balas,et al. Intersection Cuts - A New Type of Cutting Planes for Integer Programming , 1971, Oper. Res..
[17] Ellis L. Johnson. On the group problem for mixed integer programming , 1974 .
[18] Fred W. Glover. Polyhedral convexity cuts and negative edge extensions , 1974, Z. Oper. Research.
[19] Claude-Alain Burdet. Enumerative Cuts: I , 1973, Oper. Res..