David Pisinger

From MaRDI portal
Person:168068

Available identifiers

zbMath Open pisinger.davidDBLP35/4713WikidataQ28035668 ScholiaQ28035668MaRDI QIDQ168068

List of research outcomes





PublicationDate of PublicationType
Topology reconstruction using time series data in telecommunication networks2024-03-15Paper
Decision support for the technician routing and scheduling problem2024-01-18Paper
Balanced cable routing for offshore wind farms with obstacles2023-12-12Paper
Obituary for Professor Emeritus Jakob Kraurp2023-07-11Paper
Combined layout and cable optimization of offshore wind farms2023-07-11Paper
Liner Shipping Cargo Allocation with Repositioning of Empty Containers2023-05-09Paper
Data and results for the paper "Decision Support for the Technician Routing and Scheduling Problem"2023-05-07Dataset
Optimization of the drayage problem using exact methods2023-03-02Paper
A minimal algorithm for the Bounded Knapsack Problem2022-08-30Paper
Reducing disease spread through optimization: limiting mixture of the population is more important than limiting group sizes2022-06-22Paper
A branch-and-price algorithm for solving the single-hub feeder network design problem2022-03-18Paper
Variable neighborhood search for large offshore wind farm layout optimization2022-03-09Paper
The transit time constrained fixed charge multi-commodity network design problem2022-03-09Paper
Optimal retirement planning with a focus on single and joint life annuities2021-07-16Paper
Modeling and solving the multimodal car- and ride-sharing problem2021-06-07Paper
An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports2021-05-03Paper
Constraint programming and local search heuristic: a matheuristic approach for routing and scheduling feeder vessels in multi-terminal ports2021-02-08Paper
Baggage carousel assignment at airports: model and case study2021-02-08Paper
Finding a portfolio of near-optimal aggregated solutions to capacity expansion energy system models2021-02-08Paper
Liner shipping network design2020-05-27Paper
Speed optimizations for liner networks with business constraints2020-05-27Paper
A comparative study of time aggregation techniques in relation to power capacity expansion modeling2019-11-07Paper
Rejoinder on: ``A comparative study of time aggregation techniques in relation to power capacity-expansion modeling2019-11-07Paper
Optimization in liner shipping2019-03-06Paper
Optimizing wind farm cable routing considering power losses2018-07-25Paper
Competitive liner shipping network design2018-07-11Paper
Tolerance analysis for 0-1 knapsack problems2018-05-25Paper
Mixed integer linear programming for new trends in wind farm cable routing2018-04-11Paper
Optimizing the supply chain of biomass and biogas for a single plant considering mass and energy losses2017-12-06Paper
Optimization in liner shipping2017-04-21Paper
The load-balanced multi-dimensional bin-packing problem2016-11-17Paper
Single liner shipping service design2016-11-10Paper
Single string planning problem arising in liner shipping industries: a heuristic approach2016-11-10Paper
A combined stochastic programming and optimal control approach to personal finance and pensions2015-08-03Paper
Optimal annuity portfolio under inflation risk2015-07-24Paper
A branch-and-cut algorithm for the capacitated profitable tour problem2015-04-09Paper
Scheduling of outbound luggage handling at airports2015-03-03Paper
A service flow model for the liner shipping network design problem2015-02-19Paper
The vessel schedule recovery problem (VSRP) -- a MIP model for handling disruptions in liner shipping2014-07-27Paper
Integrated job scheduling and network routing2013-08-06Paper
A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times2012-08-16Paper
Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem2012-06-18Paper
Denser packings obtained in \(O(n \log \log n)\) time2012-06-18Paper
Guided local search for the three-dimensional bin-packing problem2012-05-30Paper
Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem2012-02-12Paper
Optimal wafer cutting in shuttle layout problems2011-09-27Paper
Multi-objective and multi-constrained non-additive shortest path problems2010-12-01Paper
Multi-dimensional bin packing problems with guillotine constraints2010-06-11Paper
Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows2010-06-02Paper
Interactive Cost Configuration Over Decision Diagrams2010-03-15Paper
Heuristics for container loading of furniture2009-12-10Paper
Two- and three-index formulations of the minimum cost multicommodity \(k\)-splittable flow problem2009-11-17Paper
Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows2009-08-13Paper
Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems2009-07-18Paper
Heuristic approaches for the two- and three-dimensional knapsack packing problem2008-12-04Paper
The quadratic knapsack problem -- a survey2007-04-13Paper
A general heuristic for vehicle routing problems2007-02-26Paper
Upper bounds and exact algorithms for \(p\)-dispersion problems2006-06-30Paper
A unified heuristic for a large class of vehicle routing problems with backhauls2006-03-22Paper
The two-dimensional bin packing problem with variable bin sizes and costs2005-10-10Paper
Where are the hard knapsack problems?2005-04-21Paper
https://portal.mardi4nfdi.de/entity/Q48213032004-10-12Paper
A Minimal Algorithm for the Bounded Knapsack Problem2003-11-06Paper
Guided local search for final placement in VLSI design2003-08-28Paper
Dynamic programming on the word RAM2003-06-02Paper
Heuristics for the container loading problem2002-11-17Paper
Discrete location problems with push-pull objectives2002-09-17Paper
The Three-Dimensional Bin Packing Problem2002-06-04Paper
Core problems in knapsack algorithms2002-02-07Paper
Upper bounds on the covering number of Galois-planes with small order2001-09-03Paper
Budgeting with bounded multiple-choice constraints.2001-03-28Paper
An exact algorithm for large multiple knapsack problems2000-11-27Paper
New trends in exact algorithms for the \(0-1\) knapsack problem2000-07-09Paper
Approximation algorithms for knapsack problems with cardinality constraints2000-07-09Paper
Linear Time Algorithms for Knapsack Problems with Bounded Weights2000-02-06Paper
https://portal.mardi4nfdi.de/entity/Q42474401999-06-16Paper
A fast algorithm for strongly correlated knapsack problems1999-03-22Paper
Avoiding anomalies in the \(MT2\) algorithm by Martello and Toth1999-02-02Paper
Exact Solution of the Quadratic Knapsack Problem1999-01-01Paper
A Minimal Algorithm for the 0-1 Knapsack Problem1998-08-10Paper
An expanding-core algorithm for the exact \(0-1\) knapsack problem1998-07-14Paper
A minimal algorithm for the multiple-choice knapsack problem1998-06-11Paper
Simple but efficient approaches for the collapsing knapsack problem1997-09-04Paper

Research outcomes over time

This page was built for person: David Pisinger