Search filters

Authors whose works are in public domain in at least one jurisdiction

List of works by David Pisinger

A Base Integer Programming Model and Benchmark Suite for Liner-Shipping Network Design

article

A Branch-and-Price algorithm for railway rolling stock rescheduling

A Matheuristic for the Liner Shipping Network Design Problem with Transit Time Restrictions

A Minimal Algorithm for the 0-1 Knapsack Problem

A Minimal Algorithm for the Bounded Knapsack Problem

A branch and cut algorithm for the container shipping network design problem

article by Line Blander Reinhardt & David Pisinger published 16 July 2011 in Flexible Services and Manufacturing Journal

A branch-and-cut algorithm for the capacitated profitable tour problem

scholarly article by Mads Kehlet Jepsen et al published November 2014 in Discrete Optimization

A combined stochastic programming and optimal control approach to personal finance and pensions

A dynamic programming approach for optimizing train speed profiles with speed restrictions and passage points

A fast algorithm for strongly correlated knapsack problems

A flow-first route-next heuristic for liner shipping network design

A general heuristic for vehicle routing problems

A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times

A matheuristic for the liner shipping network design problem

article by Berit Dangaard Brouer et al published December 2014 in Transportation Research Part E - Logistics and Transportation Review

A minimal algorithm for the multiple-choice knapsack problem

A service flow model for the liner shipping network design problem

article

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

Algorithm 864

article published in 2007

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

article published in 2006

An exact algorithm for large multiple knapsack problems

An expanding-core algorithm for the exact 0–1 knapsack problem

Approximation algorithms for knapsack problems with cardinality constraints

Avoiding anomalies in the mt2 algorithm by Martello and Toth

Budgeting with bounded multiple-choice constraints

Bunker purchasing with contracts

Capacity Analysis of Freight Transport with Application to the Danish and Southern Swedish Railway

Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows

Competitive Liner Shipping Network Design

Core Problems in Knapsack Algorithms

scholarly article by David Pisinger published August 1999 in Operations Research

Denser Packings Obtained inO(nlog logn) Time

Discrete location problems with push–pull objectives

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

Editorial

Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems

scholarly article published in Operations Research

Exact Solution of the Quadratic Knapsack Problem

Fleet deployment, network design and hub location of liner shipping companies

Guided Local Search for the Three-Dimensional Bin-Packing Problem

Heuristic approaches for the two- and three-dimensional knapsack packing problem

article published in 2009

Heuristics for container loading of furniture

Heuristics for the container loading problem

Integrated job scheduling and network routing

Inter-array cable routing optimization for big wind parks with obstacles

Knapsack Problems

book by Hans Kellerer

Large Neighborhood Search

Linear Time Algorithms for Knapsack Problems with Bounded Weights

scholarly article by David Pisinger published October 1999 in Journal of Algorithms

Liner Shipping Cargo Allocation with Repositioning of Empty Containers

Liner shipping hub network design in a competitive environment

article by Shahin Gelareh et al published November 2010 in Transportation Research Part E - Logistics and Transportation Review

Local search for final placement in VLSI design

Logistics in supply chains (Part 2)

Mixed Integer Linear Programming for new trends in wind farm cable routing

scholarly article by Martina Fischetti & David Pisinger published February 2018 in Electronic Notes in Discrete Mathematics

Multi-dimensional bin packing problems with guillotine constraints

Multi-objective and multi-constrained non-additive shortest path problems

article by Line Blander Reinhardt & David Pisinger published March 2011 in Computers and Operations Research

New trends in exact algorithms for the 0–1 knapsack problem

scholarly article by Silvano Martello et al published June 2000 in European Journal of Operational Research

On the Impact of Considering Power Losses in Offshore Wind Farm Cable Routing

On the Impact of using Mixed Integer Programming Techniques on Real-world Offshore Wind Parks

Operational Research: Making an impact

Optimal annuity portfolio under inflation risk

Optimal retirement planning with a focus on single and joint life annuities

Optimal wafer cutting in shuttle layout problems

Optimal wind farm cable routing: Modeling branches and offshore transformer modules

Optimization in liner shipping

Optimization of the drayage problem using exact methods

Optimizing the supply chain of biomass and biogas for a single plant considering mass and energy losses

article

Optimizing wind farm cable routing considering power losses

Railway capacity and expansion analysis using time discretized paths

Scheduling EURO-k conferences

Scheduling Transportation of Live Animals to Avoid the Spread of Diseases.

article by Mikkel Sigurd et al published May 2004 in Transportation Science

Scheduling of outbound luggage handling at airports

article by Torben Barth & David Pisinger published 2012 in Operations research proceedings : papers of the annual meeting = Vorträge der Jahrestagung / DGOR

Separation and Extension of Cover Inequalities for Conic Quadratic Knapsack Constraints with Generalized Upper Bounds

Simple but efficient approaches for the collapsing knapsack problem

article by Ulrich Pferschy et al published August 1997 in Discrete Applied Mathematics

Single liner shipping service design

article by Christian E.M. Plum et al published May 2014 in Computers and Operations Research

Single string planning problem arising in liner shipping industries: A heuristic approach

Solving Vehicle Routing with Full Container Load and Time Windows

Solving the Liner Shipping Fleet Repositioning Problem with Cargo Flows

scientific article published in August 2015

Special issue on: “matheuristics”

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

Synchronized dial-a-ride transportation of disabled passengers at airports

The EURO 2000 feature issue of EJOR

The Edge Set Cost of the Vehicle Routing Problem with Time Windows

The Three-Dimensional Bin Packing Problem

The Vessel Schedule Recovery Problem (VSRP) – A MIP model for handling disruptions in liner shipping

article by Berit D. Brouer et al published January 2013 in European Journal of Operational Research

The liner shipping berth scheduling problem with transit times

The load-balanced multi-dimensional bin-packing problem

The off-line group seat reservation problem

The quadratic knapsack problem—a survey

article

The time constrained multi-commodity network flow problem and its application to liner shipping network design

article by Christian Vad Karsten et al published April 2015 in Transportation Research Part E - Logistics and Transportation Review

The transit time constrained fixed charge multi-commodity network design problem ⬇️

journal article from 'Computers & Operations Research' published in 2021

The two-dimensional bin packing problem with variable bin sizes and costs

Time constrained liner shipping network design

article by Christian Vad Karsten et al published September 2017 in Transportation Research Part E - Logistics and Transportation Review

Tolerance analysis for 0–1 knapsack problems

Train shunting at a workshop area

Two- and three-index formulations of the minimum cost multicommodity k-splittable flow problem

Upper bounds and exact algorithms for -dispersion problems

scholarly article by David Pisinger published May 2006 in Computers and Operations Research

Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem

Where are the hard knapsack problems?

article by David Pisinger published September 2005 in Computers and Operations Research

Paulina is supported by:

About Paulina

Help