After the seminal books by Martello and Toth (1990) and Kellerer, Pferschy, and Pisinger
(2004), knapsack problems became a classical and rich research area in combinatorial …

Hyper-heuristics have emerged as a way to raise the level of generality of search techniques
for computational search problems. This is in contrast to many approaches, which represent …

Structural pruning can simplify network architecture and improve inference speed. We
propose Hardware-Aware Latency Pruning (HALP) that formulates structural pruning as a …

Mobile-edge computing is a promising technology to enable real-time information
transmission and computing by offloading computation tasks from wireless devices to …

This newly expanded and updated second edition of the best-selling classic continues to
take the" mystery" out of designing algorithms, and analyzing their efficacy and efficiency …

Didaktisch effektives und effizientes Standardwerk in der 9. Auflage: Dieses Buch entstand
aus Vorlesungen zur Einführung in Operations Research (OR) für Studierende der Betriebs …

Digital computers store information in the form of bits that can take on one of two values 0
and 1, while quantum computers are based on qubits that are described by a complex …

The knapsack problem is believed to be one of the “easier” NP-hard problems. Not only can
it be solved in pseudo-polynomial time, but also decades of algorithmic improvements have …

Computation offloading is a proven successful paradigm for enabling resource-intensive
applications on mobile devices. Moreover, in view of emerging mobile collaborative …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …