Note on an improved branch-and-bound algorithm to solve \(n/m/P/F_{\text{max}}\) problems (Q1304770)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Note on an improved branch-and-bound algorithm to solve \(n/m/P/F_{\text{max}}\) problems |
scientific article; zbMATH DE number 1340329
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Note on an improved branch-and-bound algorithm to solve \(n/m/P/F_{\text{max}}\) problems |
scientific article; zbMATH DE number 1340329 |
Statements
Note on an improved branch-and-bound algorithm to solve \(n/m/P/F_{\text{max}}\) problems (English)
0 references
12 February 2002
0 references
branch-and-bound
0 references
scheduling
0 references
0 references
0.8762839
0 references
0.8747609
0 references
0.8730063
0 references
0.87276626
0 references
0.8705027
0 references
0.86822176
0 references
