1 |
N. Agin, "Optimum Seeking with Branch and Bound", Management Science, Vol. 13, No. 4, pp. B176-B185, Dec. 1966.
DOI
|
2 |
A. P. Jones and R. M. Soland, "A Branch and Bound Algorithm for Multi-level Fixed Charge Problems", Management Science, Vol. 16, No. 1, pp. 67-76, Sep. 1969, https://doi.org/10.1287/mnsc.16.1.67.
DOI
|
3 |
A. O'sullivan and S. M. Sheffrin, "Economics: Principles in Action", Upper Saddle River, NJ: Pearson Prentice Hall. pp. 157, 2003, ISBN: 0-13-063085-3.
|
4 |
J. E. Mitchell, "Branch-and-Cut Algorithms for Combinatorial Optimization Problems", Handbook of Applied Optimization, pp. 65-77, 2002.
|
5 |
M. Edvall, "Bid Evaluation", Tomlab Optimization Inc, http://tomsym.com/examples/tomsymbidding.html, Feb. 2010.
|
6 |
J. Bracken and G. P. McCormick, "Selected Applications of Nonlinear Programming, Chapter 3. Bid Evaluation", John Wiley and Sons, New York, pp. 28-36, Oct. 1968.
|