TRAVELING-SALESMAN PROBLEM; HEAD PLACEMENT MACHINES; CHOICE KNAPSACK-PROBLEM; GENETIC ALGORITHM; SCHEDULING PROBLEM; SIDE CONSTRAINTS; APPROXIMATION; GENERATION; OPERATIONS; BRANCH
COMPUTERS INDUSTRIAL ENGINEERING, v.80, pp.245 - 253
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.