Pages that link to "Item:Q5652427"
From MaRDI portal
The following pages link to Solving Resource-Constrained Network Problems by Implicit Enumeration—Preemptive Case (Q5652427):
Displaying 3 items.
- Some efficient multi-heuristic procedures for resource-constrained project scheduling (Q721676) (← links)
- An upper bound for the speedup of parallel best-bound branch-and-bound algorithms (Q1072940) (← links)
- Considering project management activities for engineering design groups (Q2226486) (← links)
