In this paper we review the exact algorithms based on the branch and bound approach proposed in the last years for the solution of the basic version of the vehicle routing problem (VRP), where onlyâ€¦ (More)

Symmetri Generalized Travelling Salesman Problem Matteo Fis hetti Juan Jos e Salazar Gonz alezy Paolo Tothz January 1994; Revised May 1995 Abstra t We onsider a variant of the lassi al symmetriâ€¦ (More)

We present a Lagrangian-based heuristic for the well-known Set Covering Problem (SCP). The algorithm was initially designed for solving very large scale SCP instances, involving up to 5,000 rows andâ€¦ (More)

Two new algorithms recently proved to outperform all previous methods for the exact solution of the 0-1 Knapsack Problem. This paper presents a combination of such approaches, where, in addition,â€¦ (More)

The bin packing problem, in which a set of items of various sizes has to be packed into a minimum number of identical bins, has been extensively studied during the past fifteen years, mainly with theâ€¦ (More)

We consider generalized assignment problems with different objective functions: mln-sum, max-sum, rain-max, max-min. We review transformations, bounds, approximation algorithms and exact algorithms.â€¦ (More)

The Quadratic Knapsack Problem (QKP) calls for maximizing a quadratic objective function subject to a knapsack constraint, where all coeecients are assumed to be nonnegative and all variables areâ€¦ (More)