A Subadditive Approach to Solve Linear Integer Programs
暂无分享,去创建一个
A method is presented for solving pure integer programs by a subadditive method. This work extends to the integer linear problem a method for solving the group problem. It uses some elements of both enumeration and cutting plane theory in a unified setting. The method generates a subadditive function and solves the original integer linear program.
[1] Ellis L. Johnson. On the group problem for mixed integer programming , 1974 .
[2] R. Gomory. Some polyhedra related to combinatorial problems , 1969 .
[3] Claude-Alain Burdet. Enumerative Cuts: I , 1973, Oper. Res..
[4] Ellis L. Johnson,et al. Some continuous functions related to corner polyhedra , 1972, Math. Program..
[5] Claude-Alain Burdet,et al. A subadditive approach to the group problem of integer programming , 1974 .