David Pisinger

Affiliations:
  • University of Copenhagen, Denmark


According to our database1, David Pisinger authored at least 94 papers between 1997 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
A branch-and-price algorithm for solving the single-hub feeder network design problem.
Eur. J. Oper. Res., 2022

Variable neighborhood search for large offshore wind farm layout optimization.
Comput. Oper. Res., 2022

Reducing disease spread through optimization: Limiting mixture of the population is more important than limiting group sizes.
Comput. Oper. Res., 2022

2021
Managing Shutdown Decisions in Merchant Commodity and Energy Production: A Social Commerce Perspective.
Manuf. Serv. Oper. Manag., 2021

Modeling and solving the multimodal car- and ride-sharing problem.
Eur. J. Oper. Res., 2021

The Baggage Belt Assignment Problem.
EURO J. Transp. Logist., 2021

The transit time constrained fixed charge multi-commodity network design problem.
Comput. Oper. Res., 2021

2020
Vattenfall Optimizes Offshore Wind Farm Design.
INFORMS J. Appl. Anal., 2020

Speed optimizations for liner networks with business constraints.
Eur. J. Oper. Res., 2020

An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports.
Eur. J. Oper. Res., 2020

Liner shipping network design.
Eur. J. Oper. Res., 2020

Time Aggregation Techniques Applied to a Capacity Expansion Model for Real-Life Sector Coupled Energy Systems.
CoRR, 2020

Modeling and solving a vehicle-sharing problem.
CoRR, 2020

2019
Mathematical Optimization and Algorithms for Offshore Wind Farm Design: An Overview.
Bus. Inf. Syst. Eng., 2019

2018
Simultaneous Optimization of Container Ship Sailing Speed and Container Routing with Transit Time Restrictions.
Transp. Sci., 2018

A flow-first route-next heuristic for liner shipping network design.
Networks, 2018

Optimal wind farm cable routing: Modeling branches and offshore transformer modules.
Networks, 2018

Scheduling EURO-k conferences.
Eur. J. Oper. Res., 2018

Optimizing wind farm cable routing considering power losses.
Eur. J. Oper. Res., 2018

Operational Research: Making an impact.
Eur. J. Oper. Res., 2018

Mixed Integer Linear Programming for new trends in wind farm cable routing.
Electron. Notes Discret. Math., 2018

Optimization in liner shipping.
Ann. Oper. Res., 2018

2017
Tolerance analysis for 0-1 knapsack problems.
Eur. J. Oper. Res., 2017

Optimizing the supply chain of biomass and biogas for a single plant considering mass and energy losses.
Eur. J. Oper. Res., 2017

Competitive Liner Shipping Network Design.
Comput. Oper. Res., 2017

On the Impact of using Mixed Integer Programming Techniques on Real-world Offshore Wind Parks.
Proceedings of the 6th International Conference on Operations Research and Enterprise Systems, 2017

2016
The Edge Set Cost of the Vehicle Routing Problem with Time Windows.
Transp. Sci., 2016

Optimization of the drayage problem using exact methods.
INFOR Inf. Syst. Oper. Res., 2016

The load-balanced multi-dimensional bin-packing problem.
Comput. Oper. Res., 2016

Inter-array cable routing optimization for big wind parks with obstacles.
Proceedings of the 15th European Control Conference, 2016

2015
Solving the Liner Shipping Fleet Repositioning Problem with Cargo Flows.
Transp. Sci., 2015

A combined stochastic programming and optimal control approach to personal finance and pensions.
OR Spectr., 2015

Optimal annuity portfolio under inflation risk.
Comput. Manag. Sci., 2015

Capacity Analysis of Freight Transport with Application to the Danish and Southern Swedish Railway.
Proceedings of the Computational Logistics - 6th International Conference, 2015

A Matheuristic for the Liner Shipping Network Design Problem with Transit Time Restrictions.
Proceedings of the Computational Logistics - 6th International Conference, 2015

2014
A Base Integer Programming Model and Benchmark Suite for Liner-Shipping Network Design.
Transp. Sci., 2014

A service flow model for the liner shipping network design problem.
Eur. J. Oper. Res., 2014

Special issue on: "matheuristics".
EURO J. Comput. Optim., 2014

A branch-and-cut algorithm for the capacitated profitable tour problem.
Discret. Optim., 2014

Single liner shipping service design.
Comput. Oper. Res., 2014

2013
Integrated job scheduling and network routing.
Networks, 2013

Separation and Extension of Cover Inequalities for Conic Quadratic Knapsack Constraints with Generalized Upper Bounds.
INFORMS J. Comput., 2013

Synchronized dial-a-ride transportation of disabled passengers at airports.
Eur. J. Oper. Res., 2013

The Vessel Schedule Recovery Problem (VSRP) - A MIP model for handling disruptions in liner shipping.
Eur. J. Oper. Res., 2013

Single string planning problem arising in liner shipping industries: A heuristic approach.
Comput. Oper. Res., 2013

2012
A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times.
Eur. J. Oper. Res., 2012

Solving Vehicle Routing with Full Container Load and Time Windows.
Proceedings of the Computational Logistics - Third International Conference, 2012

2011
Optimal wafer cutting in shuttle layout problems.
J. Comb. Optim., 2011

Liner Shipping Cargo Allocation with Repositioning of Empty Containers.
INFOR Inf. Syst. Oper. Res., 2011

Multi-objective and multi-constrained non-additive shortest path problems.
Comput. Oper. Res., 2011

Scheduling of outbound luggage handling at airports.
Proceedings of the Operations Research Proceedings 2011, Selected Papers of the International Conference on Operations Research (OR 2011), August 30, 2011

2010
Interactive Cost Configuration Over Decision Diagrams.
J. Artif. Intell. Res., 2010

Two- and three-index formulations of the minimum cost multicommodity k-splittable flow problem.
Eur. J. Oper. Res., 2010

Heuristics for container loading of furniture.
Eur. J. Oper. Res., 2010

The off-line group seat reservation problem.
Eur. J. Oper. Res., 2010

Multi-dimensional bin packing problems with guillotine constraints.
Comput. Oper. Res., 2010

2009
ENERPLAN - Green Logistic Solutions.
ERCIM News, 2009

Heuristic approaches for the two- and three-dimensional knapsack packing problem.
Comput. Oper. Res., 2009

2008
Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows.
Oper. Res., 2008

2007
Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem.
ACM Trans. Math. Softw., 2007

Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem.
INFORMS J. Comput., 2007

Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction.
INFORMS J. Comput., 2007

Denser Packings Obtained in <i>O</i>(<i>n</i> log log <i>n</i>) Time.
INFORMS J. Comput., 2007

The quadratic knapsack problem - a survey.
Discret. Appl. Math., 2007

A general heuristic for vehicle routing problems.
Comput. Oper. Res., 2007

2006
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows.
Transp. Sci., 2006

A unified heuristic for a large class of Vehicle Routing Problems with Backhauls.
Eur. J. Oper. Res., 2006

Upper bounds and exact algorithms for <i>p</i>-dispersion problems.
Comput. Oper. Res., 2006

2005
Erratum to "The Three-Dimensional Bin Packing Problem": Robot-Packable and Orthogonal Variants of Packing Problems.
Oper. Res., 2005

The two-dimensional bin packing problem with variable bin sizes and costs.
Discret. Optim., 2005

Where are the hard knapsack problems?
Comput. Oper. Res., 2005

2004
Scheduling Transportation of Live Animals to Avoid the Spread of Diseases.
Transp. Sci., 2004

Knapsack problems.
Springer, ISBN: 978-3-540-40286-2, 2004

2003
Guided Local Search for the Three-Dimensional Bin-Packing Problem.
INFORMS J. Comput., 2003

Guided Local Search for Final Placement in VLSI Design.
J. Heuristics, 2003

Dynamic Programming on the Word RAM.
Algorithmica, 2003

2002
Heuristics for the container loading problem.
Eur. J. Oper. Res., 2002

The EURO 2000 feature issue of EJOR.
Eur. J. Oper. Res., 2002

Discrete location problems with push-pull objectives.
Discret. Appl. Math., 2002

2001
Upper Bounds on the Covering Number of Galois-Planes with Small Order.
J. Heuristics, 2001

Budgeting with bounded multiple-choice constraints.
Eur. J. Oper. Res., 2001

Local Search for Final Placement in VLSI Design.
Proceedings of the 2001 IEEE/ACM International Conference on Computer-Aided Design, 2001

2000
The Three-Dimensional Bin Packing Problem.
Oper. Res., 2000

A Minimal Algorithm for the Bounded Knapsack Problem.
INFORMS J. Comput., 2000

New trends in exact algorithms for the 0-1 knapsack problem.
Eur. J. Oper. Res., 2000

Editorial.
Eur. J. Oper. Res., 2000

Approximation algorithms for knapsack problems with cardinality constraints.
Eur. J. Oper. Res., 2000

1999
Linear Time Algorithms for Knapsack Problems with Bounded Weights.
J. Algorithms, 1999

Core Problems in Knapsack Algorithms.
Oper. Res., 1999

Exact Solution of the Quadratic Knapsack Problem.
INFORMS J. Comput., 1999

An exact algorithm for large multiple knapsack problems.
Eur. J. Oper. Res., 1999

1998
A Fast Algorithm for Strongly Correlated Knapsack Problems.
Discret. Appl. Math., 1998

1997
A Minimal Algorithm for the 0-1 Knapsack Problem.
Oper. Res., 1997

Simple But Efficient Approaches for the Collapsing Knapsack Problem.
Discret. Appl. Math., 1997


  Loading...