Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization
Year of publication: |
2000
|
---|---|
Authors: | Pastor, Rafael ; Corominas, Albert |
Published in: |
TOP: An Official Journal of the Spanish Society of Statistics and Operations Research. - Springer. - Vol. 8.2000, 1, p. 111-134
|
Publisher: |
Springer |
Subject: | combinatorial optimization | branch and bound | artificial intelligence |
-
Machine learning for combinatorial optimization : a methodological tour d'horizon
Bengio, Yoshua, (2021)
-
Branch and win: OR tree search algorithms for solving combinatorial optimisation problems
Pastor, Rafael, (2004)
-
Morrison, David Robert, (2014)
- More ...
-
Optimal priority ordering in PHP production of multiple part-types in a failure-prone machine
Sánchez, Ana, (2009)
-
Balancing assembly line with skilled and unskilled workers
Corominas, Albert, (2008)
-
Determining the most appropriate set of weekly working hours for planning annualised working time
Lusa, Amaia, (2008)
- More ...