• Publications
  • Influence
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows
The pickup and delivery problem with time windows is the problem of serving a number of transportation requests using a limited amount of vehicles. Each request involves moving a number of goods fromExpand
  • 1,062
  • 206
A general heuristic for vehicle routing problems
We present a unified heuristic which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacitated vehicle routingExpand
  • 1,042
  • 145
Knapsack problems
  • 711
  • 112
A unified heuristic for a large class of Vehicle Routing Problems with Backhauls
The Vehicle Routing Problem with Backhauls is a generalization of the ordinary capacitated vehicle routing problem where goods are delivered from the depot to the linehaul customers, and additionalExpand
  • 349
  • 71
The Three-Dimensional Bin Packing Problem
The problem addressed in this paper is that of orthogonally packing a given set of rectangular-shaped items into the minimum number of three-dimensional rectangular bins. The problem is stronglyExpand
  • 466
  • 45
A minimal algorithm for the multiple-choice knapsack problem
The Multiple-Choice Knapsack Problem is defined as a 0–1 Knapsack Problem with the addition of disjoined multiple-choice constraints. As for other knapsack problems most of the computational effortExpand
  • 253
  • 45
Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
This paper presents a branch-and-cut-and-price algorithm for the vehicle-routing problem with time windows. The standard Dantzig-Wolfe decomposition of the arc flow formulation leads to aExpand
  • 245
  • 39
Where are the hard knapsack problems?
  • David Pisinger
  • Computer Science, Mathematics
  • Comput. Oper. Res.
  • 1 September 2005
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 made it possible toExpand
  • 316
  • 35
Algorithms for Knapsack Problems
  • 287
  • 35
Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
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 additi on,Expand
  • 325
  • 29