The Cut Search Algorithm with Arc Capacities and Lower Bounds

DOI10.1287/MNSC.25.4.396zbMATH Open0423.90017OpenAlexW2125454026MaRDI QIDQ3857976FDOQ3857976

Mohamed I. Dessouky, Steve Jun. Phillips

Publication date: 1979

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.25.4.396

zbMATH Keywords

lower boundsproject managementflow networksmaximal flow problemscomputational procedurearc capacitiescut search algorithmproject time problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35)

Cited In (1)

• Resource-constrained project scheduling: Notation, classification, models, and methods

This page was built for publication: The Cut Search Algorithm with Arc Capacities and Lower Bounds

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