A new global approach for 0-1 polynomial programs
暂无分享,去创建一个
[1] Hanif D. Sherali,et al. Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems , 1990, Oper. Res..
[2] Fred W. Glover,et al. Technical Note - Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program , 1974, Oper. Res..
[3] E. Sandgren,et al. Nonlinear Integer and Discrete Programming in Mechanical Design Optimization , 1990 .
[4] Jadranka Skorin-Kapov,et al. Tabu Search Applied to the Quadratic Assignment Problem , 1990, INFORMS J. Comput..
[5] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[6] James R. Burns,et al. An implicit branch-and-bound algorithm for mixed-integer-linear programming , 1990, Comput. Oper. Res..
[7] Han-Lin Li,et al. An approximate method for local optima for nonlinear mixed integer programming problems , 1992, Comput. Oper. Res..
[8] Ian C. Goulter,et al. MIXED INTEGER MODEL FOR RESOURCE ALLOCATION IN PROJECT MANAGEMENT , 1989 .
[9] Jasbir S. Arora,et al. INTERACTIVE DESIGN OPTIMIZATION , 1988 .
[10] Robert L. Schmidt,et al. An improved discrete dynamic programming algorithm for allocating resources among interdependent projects , 1991 .
[11] G. Nemhauser,et al. Integer Programming , 2020 .
[12] A. Hertz. Tabu search for large scale timetabling problems , 1991 .