A number theoretic reformulation and decomposition method for integer programming
暂无分享,去创建一个
[1] M. Thomas,et al. Decomposition of the Group Problem in Integer Programming. , 1971 .
[2] J. Shapiro. Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem , 1968 .
[3] G. Nemhauser,et al. Integer Programming , 2020 .
[4] L. Wolsey. Extensions of the Group Theoretic Approach in Integer Programming , 1971 .
[5] R. Gomory. Some polyhedra related to combinatorial problems , 1969 .
[6] 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.
[7] G. H. Bradley. Equivalent Integer Programs and Canonical Problems , 1971 .
[8] Laurence A. Wolsey,et al. Generalized dynamic programming methods in integer programming , 1973, Math. Program..
[9] M. Padberg. Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach , 1972 .
[10] Gordon H. Bradley,et al. Transformation of integer programs to knapsack problems , 1971, Discret. Math..
[11] J. F. Benders. Partitioning procedures for solving mixed-variables programming problems , 1962 .
[12] S. Vajda,et al. Integer Programming and Network Flows , 1970 .