论文信息 - A New Approach to Discrete Mathematical Programming

A New Approach to Discrete Mathematical Programming

This paper presents the theoretical foundations for a new approach to integer programming. On the basis of the theoretical arguments, various specific computational procedures are developed which could be used to solve the integer programming problem. However, definitive computational results are not presented. In future papers we plan to explore the various computational options developed here.

Andrew B. Whinston | Glenn W. Graves | Andrew Whinston | G. Graves

[1] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .

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

[3] W. Feller,et al. An Introduction to Probability Theory and Its Application. , 1951 .

[4] Andrew Whinston,et al. An Algorithm for the Quadratic Assignment Problem , 1970 .

[5] P. Gilmore. Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem , 1962 .

[6] S. Gupta. Probability Integrals of Multivariate Normal and Multivariate $t^1$ , 1963 .

[7] G. Tarry,et al. Le problème des labyrinthes , 1895 .

[8] Michel Balinski,et al. Integer Programming: Methods, Uses, Computations , 1965 .

[9] A. M. Geoffrion. Integer Programming by Implicit Enumeration and Balas’ Method , 1967 .

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