Browsing by Subject "NP-complete"
Now showing items 1-2 of 2
-
Optimization problems are ubiquitous in but not limited to the sciences, engineering, and applied mathematics. Examples range from the fastest way USPS can route packages through a delivery network to the best way an ...
-
(2010-07-14)This thesis develops a simulation and visualization of a path finding algorithm based on ant pheromone paths created in 3D space. The simulation is useful as a demonstration of a heuristic approach to NP-complete problems ...