NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
311	December 15, :20 WSPC - Proceedings Trim Size: 9.75in x 6.5in Add to Reading List Source URL: www.jsbi.org Language: English - Date: 2008-12-14 21:22:09 Graph theory Mathematics Computational complexity theory NP-complete problems Clique Subgraph isomorphism problem Matching Protein kinase Protein Root-mean-square deviation of atomic positions
312	Solution Quality and Efficiency in Discrete Optimization 2 Scientific Work Add to Reading List Source URL: www.ite.ethz.ch Language: English - Date: 2008-10-23 07:55:26 Computational complexity theory Mathematics Theory of computation Operations research NP-complete problems Mathematical optimization Convex optimization Travelling salesman problem Approximation algorithm Optimization problem Algorithm Genetic algorithm
313	A Framework for Routing Systems in the Supply Chain Including: The Structure of Vehicle Routing Problems Rainer Barthels, Liechtenstein University of Applied Sciences Siegfried Weinmann, Liechtenstein University of Appli Add to Reading List Source URL: www.strc.ch Language: English - Date: 2008-11-28 02:28:53 Operations research NP-complete problems Vehicle routing problem Routing Supply chain
314	Vehicle Routing for a Complex Waste Collection Problem Iliya Markov, Ecole Polytechnique Fédérale de Lausanne Sacha Varone, Haute Ecole de Gestion de Genève Michel Bierlaire, Ecole Polytechnique Fédérale de Lausanne Add to Reading List Source URL: www.strc.ch Language: English - Date: 2014-05-14 02:10:52 NP-complete problems Operations research Vehicle routing problem Travelling salesman problem Applied mathematics Mathematics Variable neighborhood search Partition problem Heuristic Simulated annealing Theoretical computer science
315	Simplex with Sum of Infeasibilities for SMT Tim King⇤ ⇤ New Clark Barrett⇤ Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2013-10-18 10:27:57 Operations research Logic in computer science Electronic design automation Formal methods NP-complete problems Satisfiability modulo theories Simplex algorithm Linear programming Simplex First-order logic
316	On the Computational Complexity of ReoptimizationScientific Work Add to Reading List Source URL: www.ite.ethz.ch Language: English - Date: 2008-10-23 07:53:58 Computational complexity theory Approximation algorithms NP-complete problems Complexity classes Theoretical computer science Travelling salesman problem APX Optimization problem Combinatorial optimization Genetic algorithm Heuristic Steiner tree problem
317	EUROGRAPHICS ’M. Gross and F.R.A. Hopgood (Guest Editors) Volume 19, (2000), Number 3 Context-based Space Filling Curves Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2005-07-23 15:49:26 Mathematics Graph theory Computational complexity theory Fractal curves Television technology NP-complete problems Spanning tree Computer graphics Hilbert curve Space-filling curve Curve Peano curve
318	Magnús Már Halldórsson ICE-TCS, School of Computer Science Reykjavik University 101 Reykjavik, Iceland Add to Reading List Source URL: www.ru.is Language: English - Date: 2016-01-22 09:24:33 Computational complexity theory NP-complete problems Combinatorial optimization Theoretical computer science Maximum cut Approximation algorithm International Colloquium on Automata Languages and Programming Algorithmica Halldrsson International Symposium on Algorithms and Computation European Symposium on Algorithms Graph coloring
319	Edge-Unfolding Orthogonal Polyhedra is Strongly NP-Complete Zachary Abel1 1 MIT Erik D. Demaine2 Add to Reading List Source URL: zacharyabel.com Language: English - Date: 2016-01-24 17:37:25
320	260 Genome Informatics 16(2): 260–Interaction Graph Mining for Protein Complexes Using Local Clique Merging Add to Reading List Source URL: www.jsbi.org Language: English - Date: 2005-12-28 06:18:58 Clique NP-complete problems Neighbourhood Networks Clique problem Clique percolation method

UPDATE