The bin packing problem is a well-studied problem in combinatorial optimization. In the
classical bin packing problem, we are given a list of real numbers in (0, 1] and the goal is to …

This chapter deals with a couple of problems that are all related to the classical bin packing
problem. In this problem, one is given a list L of items (al, a2,..., a,~), each item a~ E (0, 1] …

Network function virtualization foresees the virtualization of service functions and their
execution on virtual machines. Any service is represented by a service function chain (SFC) …

The theory of deterministic sequencing and scheduling has expanded rapidly during the
past years. In this paper we survey the state of the art with respect to optimization and …

Historically, there is a close connection between geometry and optImization. This is
illustrated by methods like the gradient method and the simplex method, which are …

This paper updates a survey [53J written about 3 years ago. All of the results mentioned
there are covered here as well. However, as a major justification for this second edition we …

We are pleased to introduce the third edition of the book, and we are thankful to those who
used the book in research and practice and to those who sent us comments and feedback …

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

We analyze several “level-oriented” algorithms for packing rectangles into a unit-width,
infinite-height bin so as to minimize the total height of the packing. For the three algorithms …

Several important decision problems on conjunctive queries (CQs) are NP-complete in
general but become tractable, and actually highly parallelizable, if restricted to acyclic or …