Publisher
Springer Nature Switzerland
Reference9 articles.
1. Land, A.H., Doig, A.G.: An automatic method of solving discrete programming problems. Econometrica 28(3), 497–520 (1960)
2. Watermeyer, K., Zimmermann, J.: A partition-based branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints. OR Spectr. 44(2), 575–602 (2022)
3. Dey, S.S., Shah, P.: Lower bound on size of branch-and-bound trees for solving lot-sizing problem. Oper. Res. Lett. 50(5), 430–433 (2022)
4. Egon, B., Paolo, T.: Branch and bound methods for the traveling salesman problem. Carnegie Mellon University Graduate School of Industrial Administration (1983)
5. Glover, F.: Tabu search - Part 1. ORSA J. Comput. 1(2), 190–206 (1989)