Note on an improved branch-and-bound algorithm to solve n/m/P/F<Subscript>max</Subscript> problems
| Year of publication: |
1999
|
|---|---|
| Authors: | Companys, Ramón |
| Published in: |
TOP: An Official Journal of the Spanish Society of Statistics and Operations Research. - Springer. - Vol. 7.1999, 1, p. 25-31
|
| Publisher: |
Springer |
| Subject: | branch-and-bound | scheduling |
| Extent: | text/html |
|---|---|
| Type of publication: | Article |
| Source: |
Persistent link: https://www.econbiz.de/10005755605