Salesman - PDFSEARCH.IO - Document Search Engine

Salesman
Results: 438

#	Item
151	CCCG 2011, Toronto ON, August 10–12, 2011 Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning David Kirkpatrick∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:16 NP-complete problems Network theory Shortest path problem Geodesic Travelling salesman problem Motion planning Trigonometric functions NP Curvature Theoretical computer science Mathematics Computational complexity theory
152	CCCG 2010, Winnipeg MB, August 9–11, 2010 Watchman tours for polygons with holes Adrian Dumitrescu∗ Abstract. A watchman tour in a polygonal domain (for Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:16 Theoretical computer science Computational geometry Euclidean plane geometry Simple polygon Art gallery problem Polygon Travelling salesman problem Induced path Geometry Mathematics Polygons
153	ICS 260 – Fall 2001 – Final Exam Name: Answer Key Student ID: 1: Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2001-12-12 17:36:39 NP-complete problems Travelling salesman problem Independent set NP-complete Set cover problem NP Directed acyclic graph Kernelization Vertex cover Theoretical computer science Computational complexity theory Mathematics
154	On the Capacitated Vehicle Routing Problem∗ T.K. Ralphs†, L. Kopman‡, W.R. Pulleyblank§, and L.E. Trotter, Jr.¶ Revised December 17, 2001 Abstract We consider the Vehicle Routing Problem, in which a fixed fleet o Add to Reading List Source URL: coral.ie.lehigh.edu Language: English - Date: 2010-06-19 14:25:53 Applied mathematics Convex optimization Relaxation Linear programming Travelling salesman problem Lagrangian relaxation Simplex algorithm Mathematical optimization Operations research Mathematics
155	Optimal Convex Partitions of Point Sets with Few Inner Points Andreas Spillner∗ Abstract We present a fixed-parameter algorithm for the Minimum Convex Partition and the Minimum Weight Convex Partition problem. On a set Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-07-31 13:55:54 Mathematical optimization Computational geometry Dynamic programming Equations Systems engineering Algorithm Travelling salesman problem Convex hull Kirkpatrick–Seidel algorithm Operations research Mathematics Applied mathematics
156	Solving a Dynamic Traveling Salesman Problem with an Adaptive Hopfield Network Add to Reading List Source URL: www.complex-systems.com Language: English - Date: 2012-10-10 16:17:59 Applied mathematics Dynamical system Hopfield network Travelling salesman problem Lyapunov stability Lyapunov function Continuous function Mathematics Stability theory Mathematical analysis
157	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximation Algorithms for the Minimum-Length Corridor and Related Problems Arturo Gonzalez-Gutierrez∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:22 NP-complete problems Operations research Approximation algorithm Travelling salesman problem APX Steiner tree problem Algorithm Set cover problem Reduction Theoretical computer science Computational complexity theory Applied mathematics
158	PUSHING THE LIMIT: AMERICAN INDUSTRY DURING WORLD WAR II The American home front during World War II is essen- men were perishing on the European and Pacific fronts. It Add to Reading List Source URL: www.timelinetheatre.com Language: English - Date: 2009-09-06 16:25:48 Arthur Miller International PEN Marilyn Monroe Pulitzer Prize for Drama All My Sons Broadhurst Theatre Death of a Salesman Inge Morath Broadway theatre Arts Theatre
159	CCCG 2011, Toronto ON, August 10–12, 2011 Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning David Kirkpatrick∗ Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:16 NP-complete problems Network theory Shortest path problem Geodesic Travelling salesman problem Motion planning Trigonometric functions NP Curvature Theoretical computer science Mathematics Computational complexity theory
160	Maximizing the Number of Worker’s Self-Selected Tasks in Spatial Crowdsourcing Dingxiong Deng Cyrus Shahabi Add to Reading List Source URL: infolab.usc.edu Language: English - Date: 2013-09-13 16:17:57 Operations research Combinatorial optimization Matching Travelling salesman problem Algorithm Assignment problem Dynamic programming Mathematics Applied mathematics Theoretical computer science

UPDATE