Login / Signup
Fast approximation schemes for Boolean programming and scheduling problems related to positive convex Half-Product.
Hans Kellerer
Vitaly A. Strusevich
Published in:
Eur. J. Oper. Res. (2013)
Keyphrases
</>
approximation schemes
scheduling problem
positive and negative
positive or negative
programming language
approximation algorithms
np hard
data structure
upper bound
convex hull
convex optimization
flowshop
boolean functions