# David Pisinger

Technical University of Denmark, DTU Management, University of Copenhagen, DIKU

Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

- S. Ropke, David Pisinger
- Computer Science, Mathematics
- Transp. Sci.
- 1 November 2006

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 from… Expand

A general heuristic for vehicle routing problems

- David Pisinger, S. Ropke
- Computer Science, Mathematics
- Comput. Oper. Res.
- 1 August 2007

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 routing… Expand

A unified heuristic for a large class of Vehicle Routing Problems with Backhauls

- S. Ropke, David Pisinger
- Mathematics, Computer Science
- Eur. J. Oper. Res.
- 16 June 2006

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 additional… Expand

The Three-Dimensional Bin Packing Problem

- S. Martello, David Pisinger, D. Vigo
- Computer Science, Mathematics
- Oper. Res.
- 15 March 2000

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 strongly… Expand

A minimal algorithm for the multiple-choice knapsack problem

- David Pisinger
- Mathematics
- 1 June 1995

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 effort… Expand

Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows

- Mads Jepsen, B. Petersen, Simon Spoorendonk, David Pisinger
- Computer Science, Mathematics
- Oper. Res.
- 1 March 2008

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 a… Expand

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 to… Expand

Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem

- S. Martello, David Pisinger, P. Toth
- Mathematics
- 1 March 1999

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