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

DOI10.1287/OPRE.20.3.668MaRDI QIDQ5652427zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5652427)