Computational complexity: a conceptual perspective

O Goldreich - ACM Sigact News, 2008 - dl.acm.org
This book is rooted in the thesis that complexity theory is extremely rich in conceptual
content, and that this contents should be explicitly communicated in expositions and courses …

Combinatorial auctions: A survey

S De Vries, RV Vohra - INFORMS Journal on computing, 2003 - pubsonline.informs.org
Many auctions involve the sale of a variety of distinct assets. Examples are airport time slots,
delivery routes, network routing, and furniture. Because of complementarities or substitution …

A hybrid solution method for the capacitated vehicle routing problem using a quantum annealer

S Feld, C Roch, T Gabor, C Seidel, F Neukart… - Frontiers in …, 2019 - frontiersin.org
The Capacitated Vehicle Routing Problem (CVRP) is an NP-optimization problem (NPO)
that has been of great interest for decades for both, science and industry. The CVRP is a …

[BOEK][B] Computational complexity: a modern approach

S Arora, B Barak - 2009 - books.google.com
This beginning graduate textbook describes both recent achievements and classical results
of computational complexity theory. Requiring essentially no background apart from …

[BOEK][B] Integer programming

LA Wolsey - 2020 - books.google.com
A PRACTICAL GUIDE TO OPTIMIZATION PROBLEMS WITH DISCRETE OR INTEGER
VARIABLES, REVISED AND UPDATED The revised second edition of Integer Programming …

[BOEK][B] Protocols and architectures for wireless sensor networks

H Karl, A Willig - 2007 - books.google.com
Learn all you need to know about wireless sensor networks! Protocols and Architectures for
Wireless Sensor Networks provides a thorough description of the nuts and bolts of wireless …

Proof verification and the hardness of approximation problems

S Arora, C Lund, R Motwani, M Sudan… - Journal of the ACM …, 1998 - dl.acm.org
We show that every language in NP has a probablistic verifier that checks membership
proofs for it using logarithmic number of random bits and by examining a constant number of …

On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems

E Amaldi, V Kann - Theoretical Computer Science, 1998 - Elsevier
We investigate the computational complexity of two closely related classes of combinatorial
optimization problems for linear systems which arise in various fields such as machine …

[BOEK][B] Representations for genetic and evolutionary algorithms

F Rothlauf, F Rothlauf - 2002 - Springer
2. Representations for Genetic and Evolutionary Algorithms Page 1 2. Representations for
Genetic and Evolutionary Algorithms In this second chapter, we present an introduction into the …

A tutorial for competent memetic algorithms: model, taxonomy, and design issues

N Krasnogor, J Smith - IEEE transactions on Evolutionary …, 2005 - ieeexplore.ieee.org
The combination of evolutionary algorithms with local search was named" memetic
algorithms"(MAs)(Moscato, 1989). These methods are inspired by models of natural systems …