D
David Pisinger
Researcher at Technical University of Denmark
Publications - 175
Citations - 12726
David Pisinger is an academic researcher from Technical University of Denmark. The author has contributed to research in topics: Knapsack problem & Network planning and design. The author has an hindex of 45, co-authored 175 publications receiving 10799 citations. Previous affiliations of David Pisinger include University of Copenhagen & University of Copenhagen Faculty of Science.
Papers
More filters
Journal ArticleDOI
The load-balanced multi-dimensional bin-packing problem
Alessio Trivella,David Pisinger +1 more
TL;DR: This paper considers the bin-packing problem with the practical extension of load balancing, i.e. to find the packing requiring the minimum number of bins while ensuring that the average center of mass of the loaded bins falls as close as possible to an ideal point, for instance, the center of the bin.
Journal ArticleDOI
A Branch-and-Price algorithm for railway rolling stock rescheduling
TL;DR: In this paper, a branch-and-price algorithm is proposed to solve the problem of train unit rescheduling during a train unit maintenance restriction. But, unlike flow-based approaches, their formulation is more easily extended to handle certain families of constraints, such as train units maintenance restrictions.
Book ChapterDOI
Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows
TL;DR: This chapter shows how Chvatal-Gomory (CG) rank-1 cuts can be used in a Branch-and-Cut- and-Price algorithm for the Vehicle Routing Problem with Time Windows and presents a number of improved dominance tests exploiting the step-like structure of the objective function of the pricing problem.
Journal ArticleDOI
Competitive Liner Shipping Network Design
TL;DR: This work proposes the first practical algorithm which explicitly handles transshipment time limits for all demands, and presents a matheuristic for the problem where a MIP is used to select which ports should be inserted or removed on a route.
Journal ArticleDOI
Budgeting with bounded multiple-choice constraints
TL;DR: This work proposes an algorithm for the continuous problem based on Dantzig–Wolfe decomposition for budgeting problem where a specified number of projects from some disjoint classes has to be selected such that the overall gain is largest possible, and the costs of the chosen projects do not exceed a fixed upper limit.