David Pisinger focuses on Mathematical optimization, Continuous knapsack problem, Knapsack problem, Cutting stock problem and Change-making problem. His Mathematical optimization study incorporates themes from Algorithm and Vehicle routing problem. His Vehicle routing problem research includes elements of Search algorithm, Metaheuristic and Operations research.
His Continuous knapsack problem research incorporates themes from Quadratic programming, Lagrangian relaxation and Dynamic programming. His Cutting stock problem research is multidisciplinary, relying on both Discrete mathematics and Subset sum problem. His Change-making problem research is multidisciplinary, incorporating perspectives in Polynomial-time approximation scheme and Relaxation.
David Pisinger mainly investigates Mathematical optimization, Knapsack problem, Operations research, Continuous knapsack problem and Liner shipping. His research is interdisciplinary, bridging the disciplines of Algorithm and Mathematical optimization. He interconnects Quadratic programming, Lagrangian relaxation, Approximation algorithm and Combinatorial optimization in the investigation of issues within Knapsack problem.
His Operations research research integrates issues from Port, Vehicle routing problem, Purchasing and Integer programming. His work carried out in the field of Continuous knapsack problem brings together such families of science as Time complexity, Polynomial-time approximation scheme and Cutting stock problem. His Heuristic study integrates concerns from other disciplines, such as Metaheuristic and Benchmark.
His primary areas of investigation include Mathematical optimization, Operations research, Column generation, Integer programming and Heuristic. The study incorporates disciplines such as Quality and Selection in addition to Mathematical optimization. David Pisinger interconnects Liner shipping, Container, Truck and Fuel efficiency in the investigation of issues within Operations research.
His research in Fuel efficiency intersects with topics in Time limit, Travelling salesman problem, Metaheuristic and Vehicle routing problem. David Pisinger focuses mostly in the field of Integer programming, narrowing it down to topics relating to Robustness and, in certain cases, Stochastic modelling and Process. His research on Heuristic also deals with topics like
David Pisinger mainly focuses on Mathematical optimization, Operations research, Routing, Port and Heuristics. David Pisinger is involved in the study of Mathematical optimization that focuses on Heuristic in particular. His biological study spans a wide range of topics, including Graph, Graph, Heuristic and Benchmark.
His Operations research research includes elements of Liner shipping, Integer programming and Fuel efficiency. His Port study incorporates themes from Scheduling, Solver, Robustness and Neighbourhood search. His studies in Heuristics integrate themes in fields like Level of service, Container, Multi-commodity flow problem and Revenue.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Multidimensional Knapsack Problems
Hans Kellerer;Ulrich Pferschy;David Pisinger.
(2004)
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows
Stefan Ropke;David Pisinger.
Transportation Science (2006)
A general heuristic for vehicle routing problems
David Pisinger;Stefan Ropke.
Computers & Operations Research (2007)
The Three-Dimensional Bin Packing Problem
Silvano Martello;David Pisinger;Daniele Vigo.
Operations Research (2000)
Large Neighborhood Search
David Pisinger;Stefan Ropke.
(2010)
A Unified Heuristic for a Large Class of Vehicle Routing Problems with Backhauls
Stefan Ropke;David Pisinger.
European Journal of Operational Research (2006)
Heuristics for the container loading problem
David Pisinger.
European Journal of Operational Research (2002)
Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
Silvano Martello;David Pisinger;Paolo Toth.
Management Science (1999)
Where are the hard knapsack problems
David Pisinger.
Computers & Operations Research (2005)
Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
Mads Jepsen;Bjørn Petersen;Simon Spoorendonk;David Pisinger.
Operations Research (2008)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Technical University of Denmark
Polytechnique Montréal
University of Bologna
University of Bologna
University of Bologna
University of Bologna
RWTH Aachen University
Technical University of Denmark
Queen Mary University of London
University of Brescia
University of Auckland
University of Massachusetts Amherst
National University of Singapore
Carnegie Mellon University
University of Western Ontario
Université Savoie Mont Blanc
University College London
Carnegie Mellon University
Pennsylvania State University
Rockefeller University
University of Maryland, College Park
Cranfield University
National Institutes of Health
Utrecht University
University at Buffalo, State University of New York
King's College London