• Publications
  • Influence
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows
This paper presents a heuristic for the pickup and delivery problem based on an extension of the large neighborhood search heuristic previously suggested for solving the vehicle routing problem with time windows that is very robust and is able to adapt to various instance characteristics. Expand
A general heuristic for vehicle routing problems
A unified heuristic which is able to solve five different variants of the vehicle routing problem and shown promising results for a large class of vehicle routing problems with backhauls as demonstrated in Ropke and Pisinger. Expand
A unified heuristic for a large class of Vehicle Routing Problems with Backhauls
A unified model is developed that is capable of handling most variants of the Vehicle Routing Problem with Backhauls and it has improved the best known solution for 227 of these. Expand
The Three-Dimensional Bin Packing Problem
An exact algorithm for filling a single bin is developed, leading to the definition of an exact branch-and-bound algorithm for the three-dimensional bin packing problem, which also incorporates original approximation algorithms. Expand
A minimal algorithm for the Multiple-choice Knapsack Problem
Abstract 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 computationalExpand
Where are the hard knapsack problems?
  • David Pisinger
  • Mathematics, Computer Science
  • Comput. Oper. Res.
  • 1 September 2005
The purpose of this paper is to give an overview of all recent exact solution approaches, and to show that the knapsack problem still is hard to solve for these algorithms for a variety of new test problems. Expand
Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
The results show that applying subset-row inequalities in the master problem significantly improves the lower bound and, in many cases, makes it possible to prove optimality in the root node. Expand
Algorithms for Knapsack Problems
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