David Pisinger
Industrial and Manufacturing Engineering · 2000–2019
A researcher in the Science corpus: 11 papers; trusts 21 researchers and is trusted by 51 researchers here, as inferred from the citation graph.
Subfields
- Industrial and Manufacturing Engineering — 53 citations into it; #20 of 2,521 by trust here, #215 by citations
- Automotive Engineering — 35 citations into it; #38 of 3,081 by trust here, #1,026 by citations
- Computer Vision and Pattern Recognition — 14 citations into it; #4,488 of 21,575 by trust here, #10,010 by citations
- Building and Construction — 7 citations into it; #280 of 2,909 by trust here, #1,488 by citations
- Computer Networks and Communications — 7 citations into it; #7,701 of 9,886 by trust here, #8,543 by citations
Whom David Pisinger trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Paolo Toth
- Stefan Røpke
- Silvano Martello
- Michael A. Trick
- Russell W. Bent
- Daniele Vigo
- Jens Lysgaard
- Jean-François Cordeau
- Pascal Van Hentenryck
- Joseph B. Kruskal
Who trusts David Pisinger overall
- Stefan Røpke
- Gilbert Laporte
- David Sacramento
- Thibaut Vidal
- Jean-François Cordeau
- Teodor Gabriel Crainic
- Vera C. Hemmelmayr
- Dominik Goeke
- Gerhard Hiermann
- Manuel Iori
Papers from David Pisinger's perspective
Ordered by how strongly the researchers David Pisinger trusts endorse each paper. Same corpus, a different order for every researcher.
- Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem (Mathematical programming)
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem (INFORMS journal on computing)
- Knapsack Problems: Algorithms and Computer Implementations
- A new branch-and-cut algorithm for the capacitated vehicle routing problem (Mathematical programming)
- Optimization by Simulated Annealing
- A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows (INFORMS journal on computing)
- Solving the pickup and delivery problem with time windows using reactive tabu search
- A metaheuristic for the pickup and delivery problem with time windows (Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence. ICTAI 2001)
- A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows (Transportation Science)
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
Their papers
- Large Neighborhood Search (2018) — 598 citations
- An adaptive large neighborhood search metaheuristic for the vehicle routing problem with drones (2019) — 464 citations
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows (2008) — 449 citations
- A general heuristic for vehicle routing problems (2007) — 1,546 citations
- A unified heuristic for a large class of Vehicle Routing Problems with Backhauls (2006) — 516 citations
- An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows (2006) — 2,548 citations
- Where are the hard knapsack problems? (2005) — 566 citations
- Knapsack problems (2004) — 649 citations
- Heuristics for the container loading problem (2002) — 380 citations
- The Three-Dimensional Bin Packing Problem (2000) — 706 citations
- New trends in exact algorithms for the 0-1 knapsack problem (2000) — 339 citations