An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints.

Shieh-Shing Lin

Published in: Appl. Math. Comput. (2007)

Keyphrases

optimal solution
combinatorial optimization
primal dual
cost function
shortest path problem
search space
np hard
dynamic programming
optimization problems
solution quality
worst case
np complete
convex hull
knapsack problem
lower bound
computational complexity
approximate solutions
search algorithm