Login / Signup
Polynomially Solvable Cases of the Simple Plant Location Problem.
Alexander A. Ageev
Vladimir L. Beresnev
Published in:
IPCO (1990)
Keyphrases
</>
polynomially solvable
np complete
processing times
special case
np hard
neural network
makespan minimization
scheduling problem
theoretical analysis
single machine
machine learning
image sequences
training data
evolutionary algorithm
upper bound