David Pisinger Vis

*	2009
28	EE	Jens Egeblad, David Pisinger: Heuristic approaches for the two- and three-dimensional knapsack packing problem. Computers & OR 36(4): 1026-1049 (2009)
	2008
27	EE	Mads Jepsen, Bjørn Petersen, Simon Spoorendonk, David Pisinger: Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows. Operations Research 56(2): 497-511 (2008)
	2007
26	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)
25	EE	David Pisinger, Stefan Ropke: A general heuristic for vehicle routing problems. Computers & OR 34(8): 2403-2435 (2007)
24	EE	David Pisinger: The quadratic knapsack problem - a survey. Discrete Applied Mathematics 155(5): 623-648 (2007)
23	EE	David Pisinger, Mikkel Sigurd: Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem. INFORMS Journal on Computing 19(1): 36-51 (2007)
22	EE	David Pisinger, Anders Bo Rasmussen, Rune Sandvik: Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction. INFORMS Journal on Computing 19(2): 280-290 (2007)
21	EE	David Pisinger: Denser Packings Obtained in O(n log log n) Time. INFORMS Journal on Computing 19(3): 395-405 (2007)
	2006
20	EE	David Pisinger: Upper bounds and exact algorithms for p-dispersion problems. Computers & OR 33: 1380-1398 (2006)
19	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)
18	EE	Stefan Ropke, David Pisinger: An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows. Transportation Science 40(4): 455-472 (2006)
	2005
17	EE	David Pisinger: Where are the hard knapsack problems? Computers & OR 32: 2271-2284 (2005)
16	EE	David Pisinger, Mikkel Sigurd: The two-dimensional bin packing problem with variable bin sizes and costs. Discrete Optimization 2(2): 154-167 (2005)
15	EE	Edgar den Boef, Jan H. M. Korst, Silvano Martello, David Pisinger, Daniele Vigo: Erratum to "The Three-Dimensional Bin Packing Problem": Robot-Packable and Orthogonal Variants of Packing Problems. Operations Research 53(4): 735-736 (2005)
	2004
14	EE	Mikkel Sigurd, David Pisinger, Michael Sig: Scheduling Transportation of Live Animals to Avoid the Spread of Diseases. Transportation Science 38(2): 197-209 (2004)
	2003
13	EE	David Pisinger: Dynamic Programming on the Word RAM. Algorithmica 35(2): 128-145 (2003)
12	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)
11		Oluf Faroe, David Pisinger, Martin Zachariasen: Guided Local Search for Final Placement in VLSI Design. J. Heuristics 9(3): 269-295 (2003)
	2002
10		Jakob Krarup, David Pisinger, Frank Plastria: Discrete location problems with push-pull objectives. Discrete Applied Mathematics 123(1-3): 363-378 (2002)
9	EE	David Pisinger: Heuristics for the container loading problem. European Journal of Operational Research 141(2): 382-392 (2002)
	2001
8	EE	Oluf Faroe, David Pisinger, Martin Zachariasen: Local Search for Final Placement in VLSI Design. ICCAD 2001: 565-572
7		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
6	EE	David Pisinger: A Minimal Algorithm for the Bounded Knapsack Problem. INFORMS Journal on Computing 12(1): 75-82 (2000)
	1999
5	EE	Alberto Caprara, David Pisinger, Paolo Toth: Exact Solution of the Quadratic Knapsack Problem. INFORMS Journal on Computing 11(2): 125-137 (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	EE	David Pisinger: A Minimal Algorithm for the Bounded Knapsack Problem. IPCO 1995: 95-109

Coauthor Index

1	Edgar den Boef	[15] [26]
2	Alberto Caprara	[5]
3	Jens Egeblad	[28]
4	Oluf Faroe	[8] [11] [12]
5	T. Illés	[7]
6	Mads Jepsen	[27]
7	Jan H. M. Korst	[15] [26]
8	Jakob Krarup	[10]
9	Silvano Martello	[15] [26]
10	Bjørn Petersen	[27]
11	Ulrich Pferschy	[2]
12	Frank Plastria	[10]
13	Anders Bo Rasmussen	[22]
14	Stefan Ropke	[18] [19] [25]
15	Rune Sandvik	[22]
16	Michael Sig	[14]
17	Mikkel Sigurd	[14] [16] [23]
18	Simon Spoorendonk	[27]
19	Paolo Toth	[5]
20	Daniele Vigo	[15] [26]
21	Gerhard J. Woeginger	[2]
22	Martin Zachariasen	[8] [11] [12]

Colors in the list of coauthors