Pisinger David

David Pisinger

Information about the author David Pisinger will soon be added to the site.
Found 32 papers in total
Optimal annuity portfolio under inflation risk
Optimal annuity portfolio under inflation risk
2015
The paper investigates the importance of inflation‐linked annuities in...
Separation and Extension of Cover Inequalities for Conic Quadratic Knapsack Constraints with Generalized Upper Bounds
Separation and Extension of Cover Inequalities for Conic Quadratic Knapsack Constraints with Generalized Upper Bounds
2013
Motivated by addressing probabilistic 0–1 programs we study the conic quadratic...
Synchronized dial‐a‐ride transportation of disabled passengers at airports
Synchronized dial‐a‐ride transportation of disabled passengers at airports
2013
The largest airports have a daily average throughput of more than 500 passengers with...
The Vessel Schedule Recovery Problem (VSRP) – A MIP model for handling disruptions in liner shipping
The Vessel Schedule Recovery Problem (VSRP) – A MIP model for handling disruptions in liner shipping
2013
Containerized transport by liner shipping companies is a multi billion dollar industry...
Multi‐dimensional bin packing problems with guillotine constraints
Multi‐dimensional bin packing problems with guillotine constraints
2010
The problem addressed in this paper is the decision problem of determining if a set of...
Fleet deployment, network design and hub location of liner shipping companies
Fleet deployment, network design and hub location of liner shipping companies
2011
A mixed integer linear programming formulation is proposed for the simultaneous design...
Liner Shipping Cargo Allocation with Repositioning of Empty Containers
Liner Shipping Cargo Allocation with Repositioning of Empty Containers
2011
This paper is concerned with the cargo allocation problem considering empty...
Optimal wafer cutting in shuttle layout problems
Optimal wafer cutting in shuttle layout problems
2011
A major cost in semiconductor manufacturing is the generation of photo masks which are...
Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
2007
The two–dimensional bin–packing problem is the problem of orthogonally...
A general heuristic for vehicle routing problems
A general heuristic for vehicle routing problems
2007
We present a unified heuristic which is able to solve five different variants of the...
Upper bounds and exact algorithms for p-dispersion problems
Upper bounds and exact algorithms for p-dispersion problems
2006
The p -dispersion-sum problem is the problem of locating p facilities at some of n...
A unified heuristic for a large class of Vehicle Routing Problems with Backhauls
A unified heuristic for a large class of Vehicle Routing Problems with Backhauls
2006
The Vehicle Routing Problem with Backhauls is a generalization of the ordinary...
Guided local search for the three-dimensional bin-packing problem
Guided local search for the three-dimensional bin-packing problem
2003
The three-dimensional bin-packing problem is the problem of orthogonally packing a set...
Where are the hard knapsack problems?
Where are the hard knapsack problems?
2005
The knapsack problem is believed to be one of the “easier” NP -hard...
The two-dimensional bin packing problem with variable bin sizes and costs
The two-dimensional bin packing problem with variable bin sizes and costs
2005
The two-dimensional variable sized bin packing problem (2DVSBPP) is the problem of...
Scheduling transportation of live animals to avoid the spread of diseases
Scheduling transportation of live animals to avoid the spread of diseases
2004
In the classical vehicle-routing problem (VRP) the objective is to service some...
Guided local search for final placement in VLSI design
Guided local search for final placement in VLSI design
2003
The design of a very large scale integration circuit consists of two main parts:...
Heuristics for the container loading problem
Heuristics for the container loading problem
2002
The knapsack container loading problem is the problem of loading a subset of...
Budgeting with bounded multiple-choice constraints
Budgeting with bounded multiple-choice constraints
2001
We consider a budgeting problem where a specified number of projects from some...
A minimal algorithm for the bounded knapsack problem
A minimal algorithm for the bounded knapsack problem
2000
The Bounded Knapsack Problem (BKP) is a generalization of the 0–1 Knapsack...
The three-dimensional bin packing problem
The three-dimensional bin packing problem
2000
The problem addressed in this paper is that of orthogonally packing a given set of...
New trends in exact algorithms for the 0–1 knapsack problem
New trends in exact algorithms for the 0–1 knapsack problem
2000
While the 1980s were focused on the solution of large sized ‘easy’...
Approximation algorithms for knapsack problems with cardinality constraints
Approximation algorithms for knapsack problems with cardinality constraints
2000
We address a variant of the classical knapsack problem in which an upper bound is...
Core problems in knapsack algorithms
Core problems in knapsack algorithms
1999
Since Balas and Zemel in the 1980s introduced the so-called core problem as an...
Papers per page: