General purpose heuristics for integer programming—Part I
暂无分享,去创建一个
[1] R. Gomory. AN ALGORITHM FOR THE MIXED INTEGER PROBLEM , 1960 .
[2] R E Gomory,et al. ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS. , 1965, Proceedings of the National Academy of Sciences of the United States of America.
[3] F. Glover. HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .
[4] R E Gomory,et al. Faces of an integer polyhedron. , 1967, Proceedings of the National Academy of Sciences of the United States of America.
[5] Fred W. Glover. Cut search methods in integer programming , 1972, Math. Program..
[6] Egon Balas. Ranking the facets of the octahedron , 1972, Discret. Math..
[7] Ellis L. Johnson,et al. Some continuous functions related to corner polyhedra , 1972, Math. Program..
[8] G. Ding. Discrete optimization , 1977 .
[9] R. D. Young. Hypercylindrically Deduced Cuts in Zero-One Integer Programs , 1971, Oper. Res..
[10] F. Glover. Scatter search and star-paths: beyond the genetic metaphor , 1995 .
[11] Hanif D. Sherali,et al. A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts , 1980, Math. Program..
[12] G. Nemhauser,et al. Integer Programming , 2020 .
[13] Egon Balas,et al. An Intersection Cut from the Dual of the Unit Hypercube , 1971, Oper. Res..
[14] Egon Balas,et al. THE INTERSECTION CUT - A NEW CUTTING PLANE FOR INTEGER PROGRAMMING. , 1969 .
[15] Fred W. Glover,et al. Solving zero-one mixed integer programming problems using tabu search , 1998, European Journal of Operational Research.
[16] Nesa L'abbe Wu,et al. Linear programming and extensions , 1981 .
[17] Kurt Jörnsten,et al. Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic , 1994, INFORMS J. Comput..