Branch and win: OR tree search algorithms for solving combinatorial optimisation problems
| Year of publication: |
2004
|
|---|---|
| Authors: | Pastor, Rafael ; Corominas, Albert |
| Published in: |
TOP: An Official Journal of the Spanish Society of Statistics and Operations Research. - Springer. - Vol. 12.2004, 1, p. 169-191
|
| Publisher: |
Springer |
| Subject: | Combinatorial optimization | branch and bound | artificial intelligence |
-
Machine learning for combinatorial optimization : a methodological tour d'horizon
Bengio, Yoshua, (2021)
-
Pastor, Rafael, (2000)
-
Branch, bound and remember algorithm for two-sided assembly line balancing problem
Li, Zixiang, (2020)
- More ...
-
Determining the most appropriate set of weekly working hours for planning annualised working time
Lusa, Amaia, (2008)
-
An entropy-based measurement of working time flexibility
Olivella, Jordi, (2010)
-
Mathematical programming modeling of the Response Time Variability Problem
Corominas, Albert, (2010)
- More ...