NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
971	cc.complexity theory - Restriction of Exact Cover by 3-sets - Theoretical Computer Science Stack Exchange Add to Reading List Source URL: www.nearly42.org Language: English - Date: 2014-01-11 18:13:39 Exact cover Theoretical computer science Computer science Computational complexity theory NP-complete NP-complete problems Applied mathematics Mathematics
972	Yet Harder Knapsack ProblemsI Stasys Jukna∗,1 Georg Schnitger University of Frankfurt, Institut of Computer Science, DFrankfurt, Germany. Abstract Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2011-10-21 09:58:40 Computational complexity theory Combinatorial optimization NP-complete problems Cryptography Dynamic programming Knapsack problem Branch and bound Optimization problem Backtracking Operations research Theoretical computer science Applied mathematics
973	Application template Instructions For details of the policy and funding framework, eligibility, selection criteria, and funding deliverables and conditions, respondents should first refer to: VNPP Round 4.14_Application Add to Reading List Source URL: www.health.vic.gov.au Language: English - Date: 2014-08-05 19:32:12 Nurse practitioner Mathematical optimization NP-complete
974	A Computer System for Building Community Bys pickyp Roytes. The paper describes a computer program being deueloped by the Western Rustrallan Department of Transport that solues the Traueling Salesman Problem. There are Add to Reading List Source URL: www.atrf.info Language: English - Date: 2011-12-21 20:21:54 NP-complete problems Operations research Travelling salesman problem Combinatorial optimization Heuristic function Heuristic Pickup A* search algorithm Theoretical computer science Mathematics Computational complexity theory
975	Currently under second review in European Journal of Operational Research CHARACTERIZING SEARCH SPACES FOR TABU SEARCH Christopher R. Houck, Jeffrey A. Joines, Michael G. Kay Department of Industrial Engineering, North Add to Reading List Source URL: aiinfinance.com Language: English - Date: 2012-06-26 15:09:54 Theoretical computer science Mathematical optimization Heuristics Search algorithms NP-complete problems Genetic algorithm Tabu search Travelling salesman problem Heuristic function Applied mathematics Mathematics Operations research
976	OPTURION Righting the Wrongs of Transport Optimisation Professor Mark Wallace, October 2014 Add to Reading List Source URL: www.opturion.com Language: English - Date: 2014-10-14 22:21:10 NP-complete problems Operations research Travelling salesman problem Vehicle routing problem Routing Algorithm Workforce management Mathematics Theoretical computer science Applied mathematics
977	22nd Australasian Transport Research Forum Sydney, September 1998 A comparison of different methods for selecting and schednling transport investments Vivian Salim Add to Reading List Source URL: www.atrf.info Language: English - Date: 2012-01-03 17:54:49 Theoretical computer science NP-complete problems Cybernetics Genetic algorithm Mathematical optimization Travelling salesman problem Simulated annealing Algorithm Route assignment Mathematics Applied mathematics Operations research
978	Sage Reference Manual: Graph Theory Release 6.6.beta0 The Sage Development Team February 21, 2015 Add to Reading List Source URL: sagemath.org Language: English - Date: 2015-02-21 07:35:21 Graph Neighbourhood Adjacency matrix Line graph Directed acyclic graph Hamiltonian path Eulerian path Tree Independent set Graph theory Mathematics NP-complete problems
979	Efficient CNF Simplification based on Binary Implication Graphs⋆ Marijn Heule1 , Matti J¨arvisalo2 , and Armin Biere3 1 3 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2011-06-03 17:52:43 Propositional calculus Automated theorem proving Mathematical logic Logic in computer science NP-complete problems Conjunctive normal form Boolean satisfiability problem Resolution Unit propagation Theoretical computer science Logic Mathematics
980	UNIVERSITÉ DE BORDEAUX I LABORATOIRE BORDELAIS DE RECHERCHE EN INFORMATIQUE HABILITATION À DIRIGER DES RECHERCHES AU TITRE DE L’ÉCOLE DOCTORALE DE MATHÉMATIQUES ET D’INFORMATIQUE Add to Reading List Source URL: www.labri.fr Language: English - Date: 2010-11-27 17:55:14 Graph partition Graph Graph coloring Path decomposition Graph theory Theoretical computer science NP-complete problems

UPDATE