The relation of time indexed formulations of single machine scheduling problems to the node packing problem
From MaRDI portal
Publication:1396279
DOI10.1007/s10107-002-0335-9zbMath1023.90032MaRDI QIDQ1396279
Savelsbergh, Martin W. P., Ellis L. Johnson, Hamish Waterer, Paolo Nobili
Publication date: 30 June 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-002-0335-9
polyhedral methods; facet inducing inequalities; node packing; facet defining graphs; lifted valid inequalities; nonpreemptive single machine scheduling
Related Items
On a fix-and-relax framework for a class of project scheduling problems, Fixed interval scheduling: models, applications, computational complexity and algorithms, A computational study of a cutting plane algorithm for university course timetabling