University of Florida / Northwestern University / /
IndustryTerm
local search algorithm / simplex algorithm / neighbourhood search takes / equal processing times / neighbourhood search / feasible solution / polynomial time algorithm / local search / wide applications / approximate solution / local search algorithms / basic feasible solutions / i.e. polynomial time algorithms / near optimal solutions / arbitrary processing times / approximate solutions / feasible solutions / i . e .ii . e ..i . e .ei . e ..i . e . i . e .pi . e .oi . e .li . e .yi . e .ni . e .oi . e .mi . e .ii . e .ai . e .li . e . i . e .ti . e .ii . e .mi . e .ei . e . i . e .ai . e .li . e .gi . e .oi . e .ri . e .ii . e .ti . e .hi . e .mi . e .si . e . / /
Organization
Northwestern University / Department of Mathematics / University of Florida / Department of Industrial and Systems Engineering / /
Person
Prabha Sharma / Kanwar Sen / Jan Karel Lenstra / Manju Lata Agarwal / Emile Arts / John Wiley / /
"Shortest Path problem, the Traveling Salesman problem, or the Knapsack problem, are a few of the many combinatorial optimization problems, which have very wide applications in all spheres of our lives. Unfortunately, there is a large class of problems, denoted by class NP, for