A Branch and Bound Algorithm for Minimizing Cost in Project Scheduling (Q5636673)
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: A Branch and Bound Algorithm for Minimizing Cost in Project Scheduling |
scientific article; zbMATH DE number 3363328
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Branch and Bound Algorithm for Minimizing Cost in Project Scheduling |
scientific article; zbMATH DE number 3363328 |
Statements
A Branch and Bound Algorithm for Minimizing Cost in Project Scheduling (English)
0 references
1971
0 references
