Solving Resource-Constrained Network Problems by Implicit Enumeration—Preemptive Case

DOI10.1287/opre.20.3.668zbMath0241.90019OpenAlexW4253186916MaRDI QIDQ5652427

Linus Schrage

Publication date: 1972

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.20.3.668

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (3)

Considering project management activities for engineering design groups ⋮ Some efficient multi-heuristic procedures for resource-constrained project scheduling ⋮ An upper bound for the speedup of parallel best-bound branch-and-bound algorithms

This page was built for publication: Solving Resource-Constrained Network Problems by Implicit Enumeration—Preemptive Case