Approximation in enumeration techniques for large scale zero-one programming for corporate average fuel economy planning
暂无分享,去创建一个
[1] D. Dannenbring. Procedures for Estimating Optimal Solution Values for Large Combinatorial Problems , 1977 .
[2] Ellis L. Johnson,et al. Solving Large-Scale Zero-One Linear Programming Problems , 1983, Oper. Res..
[3] Thomas L. Morin,et al. Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The ZOOM System , 1989, INFORMS J. Comput..
[4] Bruce L. Golden. Closed-Form Statistical Estimates Of Optimal Solution Values To Combinatorial Problems , 1978, ACM Annual Conference.
[5] A. N. Elshafei,et al. Note--On the Use of Fictitious Bounds in Tree Search Algorithms , 1977 .
[6] E. Balas. An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .
[7] Michael M. Kostreva,et al. Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models , 1985, Oper. Res..