New dominance rules and exploration strategies for the 1|r <Subscript> i </Subscript>|∑U <Subscript> i </Subscript> scheduling problem
| Year of publication: |
2012
|
|---|---|
| Authors: | Kao, Gio ; Sewell, Edward ; Jacobson, Sheldon ; Hall, Shane |
| Published in: |
Computational Optimization and Applications. - Springer. - Vol. 51.2012, 3, p. 1253-1274
|
| Publisher: |
Springer |
| Subject: | Branch and bound algorithms | Scheduling theory and algorithms | Dynamic programming |
-
Sewell, Edward, (2012)
-
Enhancing branch-and-bound for multiobjective 0-1 programming
Forget, Nicolas, (2024)
-
On rigorous upper bounds to a global optimum
Kearfott, Ralph, (2014)
- More ...
-
Sewell, Edward, (2012)
-
Maximizing the effectiveness of a pediatric vaccine formulary while prohibiting extraimmunization
Hall, Shane, (2008)
-
A framework for analyzing sub-optimal performance of local search algorithms
Nikolaev, Alexander, (2011)
- More ...