An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems (Q4178760)
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: An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems |
scientific article; zbMATH DE number 3614482
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems |
scientific article; zbMATH DE number 3614482 |
Statements
An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems (English)
0 references
1978
0 references
Network Cuts
0 references
Integer Programmig Algorithm
0 references
Resource-Constrained Scheduling Problems
0 references
Implicit Enumeration
0 references
Computational
0 references
Efficiency
0 references
