A polyhedral approach to single-machine scheduling problems.
From MaRDI portal
Publication:1586211
DOI10.1007/s10107990047azbMath1072.90523MaRDI QIDQ1586211
Savelsbergh, Martin W. P., J. M. van den Akker, Stan P. M. van Hoesel
Publication date: 12 November 2000
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://cris.maastrichtuniversity.nl/ws/files/1177972/guid-b1a8d1f0-5a4c-483d-8c75-777e72eaa106-ASSET1.0.pdf
90C35: Programming involving graphs or networks
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B35: Deterministic scheduling theory in operations research
Uses Software