| 2009 |
|---|
| 20 | EE | Jens Egeblad,
David Pisinger:
Heuristic approaches for the two- and three-dimensional knapsack packing problem.
Computers & OR 36(4): 1026-1049 (2009) |
| 2007 |
|---|
| 19 | EE | Silvano Martello,
David Pisinger,
Daniele Vigo,
Edgar den Boef,
Jan H. M. Korst:
Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem.
ACM Trans. Math. Softw. 33(1): 7 (2007) |
| 18 | EE | David Pisinger,
Stefan Ropke:
A general heuristic for vehicle routing problems.
Computers & OR 34(8): 2403-2435 (2007) |
| 17 | EE | David Pisinger:
The quadratic knapsack problem - a survey.
Discrete Applied Mathematics 155(5): 623-648 (2007) |
| 2006 |
|---|
| 16 | EE | David Pisinger:
Upper bounds and exact algorithms for p-dispersion problems.
Computers & OR 33: 1380-1398 (2006) |
| 15 | EE | Stefan Ropke,
David Pisinger:
A unified heuristic for a large class of Vehicle Routing Problems with Backhauls.
European Journal of Operational Research 171(3): 750-775 (2006) |
| 2005 |
|---|
| 14 | EE | David Pisinger:
Where are the hard knapsack problems?
Computers & OR 32: 2271-2284 (2005) |
| 13 | EE | David Pisinger,
Mikkel Sigurd:
The two-dimensional bin packing problem with variable bin sizes and costs.
Discrete Optimization 2(2): 154-167 (2005) |
| 2003 |
|---|
| 12 | EE | David Pisinger:
Dynamic Programming on the Word RAM.
Algorithmica 35(2): 128-145 (2003) |
| 11 | EE | Oluf Faroe,
David Pisinger,
Martin Zachariasen:
Guided Local Search for the Three-Dimensional Bin-Packing Problem.
INFORMS Journal on Computing 15(3): 267-283 (2003) |
| 10 | | Oluf Faroe,
David Pisinger,
Martin Zachariasen:
Guided Local Search for Final Placement in VLSI Design.
J. Heuristics 9(3): 269-295 (2003) |
| 2002 |
|---|
| 9 | | Jakob Krarup,
David Pisinger,
Frank Plastria:
Discrete location problems with push-pull objectives.
Discrete Applied Mathematics 123(1-3): 363-378 (2002) |
| 8 | EE | David Pisinger:
Heuristics for the container loading problem.
European Journal of Operational Research 141(2): 382-392 (2002) |
| 2001 |
|---|
| 7 | EE | Oluf Faroe,
David Pisinger,
Martin Zachariasen:
Local Search for Final Placement in VLSI Design.
ICCAD 2001: 565-572 |
| 6 | | T. Illés,
David Pisinger:
Upper Bounds on the Covering Number of Galois-Planes with Small Order.
J. Heuristics 7(1): 59-76 (2001) |
| 2000 |
|---|
| 5 | EE | David Pisinger:
A Minimal Algorithm for the Bounded Knapsack Problem.
INFORMS Journal on Computing 12(1): 75-82 (2000) |
| 1999 |
|---|
| 4 | | David Pisinger:
Linear Time Algorithms for Knapsack Problems with Bounded Weights.
J. Algorithms 33(1): 1-14 (1999) |
| 1998 |
|---|
| 3 | EE | David Pisinger:
A Fast Algorithm for Strongly Correlated Knapsack Problems.
Discrete Applied Mathematics 89(1-3): 197-212 (1998) |
| 1997 |
|---|
| 2 | EE | Ulrich Pferschy,
David Pisinger,
Gerhard J. Woeginger:
Simple But Efficient Approaches for the Collapsing Knapsack Problem.
Discrete Applied Mathematics 77(3): 271-280 (1997) |
| 1995 |
|---|
| 1 | | David Pisinger:
A Minimal Algorithm for the Bounded Knapsack Problem.
IPCO 1995: 95-109 |
