Technical Note—An Improved Feasibility Test for Gorenstein's Algorithm
From MaRDI portal
Publication:4047427
DOI10.1287/OPRE.22.5.1117zbMath0294.90087OpenAlexW2052017166MaRDI QIDQ4047427
Leon F. McGinnis, G. E. Bennington
Publication date: 1974
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.22.5.1117
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)
Related Items (1)
This page was built for publication: Technical Note—An Improved Feasibility Test for Gorenstein's Algorithm
