An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems

From MaRDI portal
Publication:4178760

DOI10.1287/MNSC.24.11.1163zbMATH Open0395.90036OpenAlexW2066190993MaRDI QIDQ4178760FDOQ4178760


Authors: F. Brian Talbot, James H. Patterson Edit this on Wikidata


Publication date: 1978

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

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








Cited In (56)





This page was built for publication: An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems

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