Publication not explained
This publication has not yet been explained in plain language by the author(s). However, you can still read the publication.
If you are one of the authors, claim this publication so you can create a plain language summary to help more people find, understand and use it.
Featured Image
Read the Original
This page is a summary of: Near-Optimal Solutions and Large Integrality Gaps for Almost All Instances of Single-Machine Precedence-Constrained Scheduling, Mathematics of Operations Research, February 2011, INFORMS, DOI: 10.1287/moor.1100.0479.
You can read the full text:
Contributors
Be the first to contribute to this page
