Login / Signup
Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope.
Ruben Hoeksma
Bodo Manthey
Marc Uetz
Published in:
Discret. Appl. Math. (2016)
Keyphrases
</>
efficient implementation
single machine scheduling
single machine scheduling problem
convex hull
active set
computational complexity
semidefinite
branch and bound algorithm
processing times
optimization problems
knapsack problem