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 …

Production scheduling can be defined as the allocation of available production resources
over time to best satisfy some set of criteria. Typically, the scheduling problem involves a set …

Parameterized complexity/multivariate complexity algorithmics is an exciting field of modern
algorithm design and analysis, with a broad range of theoretical and practical aspects that …

We solve a challenging yet practically useful variant of 3D Bin Packing Problem (3D-BPP). In
our problem, the agent has limited information about the items to be packed into a single bin …

Although the theory of random graphs is one of the youngest branches of graph theory, in
importance it is second to none. It began with some sporadic papers of Erdős in the 1940s …

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 …

A comprehensive guide to a powerful new analytical tool by two of its foremost innovators
The past decade has witnessed many exciting advances in the use of genetic algorithms …

A PRACTICAL GUIDE TO OPTIMIZATION PROBLEMS WITH DISCRETE OR INTEGER
VARIABLES, REVISED AND UPDATED The revised second edition of Integer Programming …

An O (n 3) heuristic algorithm is described for solving d-city travelling salesman problems
(TSP) whose cost matrix satisfies the triangularity condition. The algorithm involves as …

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 …