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
Modeling and solving the multimodal car- and ride-sharing problem
TL;DR: A two-layer decomposition algorithm based on column generation is proposed, where the master problem ensures that each request can only be covered at most once, and the pricing problem generates new promising routes by solving a kind of shortest path problem in a time-space network.
Journal ArticleDOI
The liner shipping berth scheduling problem with transit times
Line Blander Reinhardt,Christian Edinger Munk Plum,David Pisinger,Mikkel M. Sigurd,Guillaume T.P. Vial +4 more
TL;DR: In this paper, speed optimization of an existing liner shipping network is solved by adjusting the port berth times, where the objective is to minimize fuel consumption while retaining the customer transit times including the transhipment times.
Journal ArticleDOI
Multi-dimensional bin packing problems with guillotine constraints
TL;DR: This paper presents a generalization of a constructive algorithm for the multi-dimensional bin packing problem, with and without the guillotine constraint, based on constraint programming.
Journal ArticleDOI
Solving the Liner Shipping Fleet Repositioning Problem with Cargo Flows
TL;DR: A novel mathematical model and a simulated annealing algorithm for the LSFRP with cargo flows that makes use of a carefully constructed graph are introduced and compared against an actual repositioning scenario.
Journal ArticleDOI
Interactive cost configuration over decision diagrams
TL;DR: This paper shows that an efficient, robust and easy to implement extension is possible if the cost function is additive, and feasible solutions are represented using multi-valued decision diagrams (MDDs), and proves that even in its simplest form, multiple-cost configuration is NP-hard in the input MDD.