Login / Signup
Parallel Approximation Schemes for a Class of Planar and Near Planar Combinatorial Optimization Problems.
Harry B. Hunt III
Madhav V. Marathe
Venkatesh Radhakrishnan
S. S. Ravi
Daniel J. Rosenkrantz
Richard Edwin Stearns
Published in:
Inf. Comput. (2002)
Keyphrases
</>
combinatorial optimization problems
approximation schemes
knapsack problem
combinatorial optimization
metaheuristic
optimization problems
discrete optimization
traveling salesman problem
job shop scheduling
search space
neural network
search algorithm
computational complexity
cost function