Salesman - PDFSEARCH.IO - Document Search Engine

Salesman
Results: 438

#	Item
131	Paradox Issue 2, 2003 The Magazine of the Melbourne University Mathematics and Statistics Society Joe Healy Add to Reading List Source URL: www.ms.unimelb.edu.au Language: English - Date: 2011-11-19 03:23:12 Complexity classes Mathematical optimization W. B. R. Lickorish P versus NP problem Travelling salesman problem Time complexity NP Knot theory P Theoretical computer science Computational complexity theory Applied mathematics
132	Algorithms Lecture thesection: Approximation Algorithms [Fa’13] Le mieux est l’ennemi du bien. [The best is the enemy of the good.] — Voltaire, La Bégueule (1772) Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:03:25 NP-complete problems Approximation algorithm Vertex cover Travelling salesman problem Graph coloring Metric k-center Dynamic programming Christofides algorithm Set cover problem Theoretical computer science Mathematics Computational complexity theory
133	Decomposition in Integer Linear Programming T.K. Ralphs∗ M.V. Galati† Revised August 16, 2005 Add to Reading List Source URL: coral.ie.lehigh.edu Language: English - Date: 2010-06-19 14:25:51 Operations research Combinatorial optimization Linear programming Convex optimization Linear programming relaxation Cutting-plane method Travelling salesman problem Relaxation Optimization problem Mathematical optimization Theoretical computer science Mathematics
134	Job shop scheduling with setup times and maximal time-lags: A simple constraint programming approach Diarmuid Grimes1 and Emmanuel Hebrard1,2 1 Cork Constraint Computation Centre & University College Cork, Ireland Add to Reading List Source URL: homepages.laas.fr Language: English - Date: 2010-11-22 06:22:31 Theoretical computer science Job shop scheduling Constraint programming Sequence-dependent setup Mathematical optimization Travelling salesman problem Operations research Applied mathematics Mathematics
135	CS 373: Combinatorial Algorithms, Fall 2000 Homework 6 (due December 7, 2000 at midnight) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:48:14 NP-complete problems Complexity classes NP-complete NP-hard NP Maximum cut Shortest path problem Travelling salesman problem P-complete Theoretical computer science Computational complexity theory Mathematics
136	CS 373: Combinatorial Algorithms, Spring 2001 http://www-courses.cs.uiuc.edu/~cs373 Homework 6 (due Tue. May 1, 2001 at 11:59.99 p.m.) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:52:35 NP-complete problems Complexity classes NP-complete NP-hard NP Travelling salesman problem Vertex cover Maximum cut Shortest path problem Theoretical computer science Computational complexity theory Mathematics
137	ICS 260 – Fall 2001 – Final Exam Name: Student ID: 1: Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2001-12-12 17:36:38 Complexity classes NP-complete problems Mathematical optimization Operations research Travelling salesman problem NP Induced path Independent set Directed acyclic graph Theoretical computer science Graph theory Computational complexity theory
138	Interactive Traffic-Aware Route Search on Smartphones Roy Levin Yaron Kanza Technion – Israel Institute of Technology Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-12-26 04:34:36 Operations research Travelling salesman problem Algorithm Poi Search algorithm Mathematics Applied mathematics Theoretical computer science
139	Exploiting symmetries in logistics distribution planning Add to Reading List Source URL: www.mssanz.org.au Language: English - Date: 2013-01-15 22:34:44 NP-complete problems Analysis of algorithms Algorithm Mathematical logic Travelling salesman problem Logistics Symmetry in mathematics Time complexity Vehicle routing problem Theoretical computer science Computational complexity theory Applied mathematics
140	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Generalized Watchman Route Problem with Discrete View Cost Pengpeng Wang∗, Ramesh Krishnamurti †, Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:28:40 Computational geometry Simple polygon Travelling salesman problem Mathematics Applied mathematics Art gallery problem

UPDATE