Relaxation Methods for Pure and Mixed Integer Programming Problems
暂无分享,去创建一个
[1] J. Rodriguez,et al. Problem (2) , 1994 .
[2] J. F. Benders. Partitioning procedures for solving mixed-variables programming problems , 1962 .
[3] S. Vajda,et al. Integer Programming and Network Flows , 1970 .
[4] Arthur M. Geoffrion,et al. Letter to the Editor - Finding Everett's Lagrange Multipliers by Linear Programming , 1966, Operational Research.
[5] Kurt Spielberg,et al. Direct Search Algorithms for Zero-One and Mixed-Integer Programming , 1967, Oper. Res..
[6] J. E. Kelley,et al. The Cutting-Plane Method for Solving Convex Programs , 1960 .
[7] Arthur M. Geoffrion. RELAXATION AND THE DUAL METHOD IN MATHEMATICAL PROGRAMMING , 1968 .
[8] G. Gorry,et al. An Adaptive Group Theoretic Algorithm for Integer Programming Problems , 2015 .
[9] H. Weingartner. Capital Budgeting of Interrelated Projects: Survey and Synthesis , 1966 .