The SCEAS System
| |||||||

## Search the dblp DataBase
David Pisinger:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Oluf Faroe, David Pisinger, Martin Zachariasen
**Local Search for Final Placement in VLSI Design.**[Citation Graph (0, 0)][DBLP] ICCAD, 2001, pp:565-572 [Conf] - David Pisinger
**A Minimal Algorithm for the Bounded Knapsack Problem.**[Citation Graph (0, 0)][DBLP] IPCO, 1995, pp:95-109 [Conf] - David Pisinger
**Dynamic Programming on the Word RAM.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2003, v:35, n:2, pp:128-145 [Journal] - David Pisinger
**Where are the hard knapsack problems?**[Citation Graph (0, 0)][DBLP] Computers & OR, 2005, v:32, n:, pp:2271-2284 [Journal] - David Pisinger
**Upper bounds and exact algorithms for**[Citation Graph (0, 0)][DBLP]*p*-dispersion problems. Computers & OR, 2006, v:33, n:, pp:1380-1398 [Journal] - Jakob Krarup, David Pisinger, Frank Plastria
**Discrete location problems with push-pull objectives.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:123, n:1-3, pp:363-378 [Journal] - Ulrich Pferschy, David Pisinger, Gerhard J. Woeginger
**Simple But Efficient Approaches for the Collapsing Knapsack Problem.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1997, v:77, n:3, pp:271-280 [Journal] - David Pisinger
**A Fast Algorithm for Strongly Correlated Knapsack Problems.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1998, v:89, n:1-3, pp:197-212 [Journal] - David Pisinger
**The quadratic knapsack problem - a survey.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:5, pp:623-648 [Journal] - T. Illés, David Pisinger
**Upper Bounds on the Covering Number of Galois-Planes with Small Order.**[Citation Graph (0, 0)][DBLP] J. Heuristics, 2001, v:7, n:1, pp:59-76 [Journal] - Oluf Faroe, David Pisinger, Martin Zachariasen
**Guided Local Search for Final Placement in VLSI Design.**[Citation Graph (0, 0)][DBLP] J. Heuristics, 2003, v:9, n:3, pp:269-295 [Journal] - Oluf Faroe, David Pisinger, Martin Zachariasen
**Guided Local Search for the Three-Dimensional Bin-Packing Problem.**[Citation Graph (0, 0)][DBLP] INFORMS Journal on Computing, 2003, v:15, n:3, pp:267-283 [Journal] - David Pisinger
**A Minimal Algorithm for the Bounded Knapsack Problem.**[Citation Graph (0, 0)][DBLP] INFORMS Journal on Computing, 2000, v:12, n:1, pp:75-82 [Journal] - David Pisinger
**Linear Time Algorithms for Knapsack Problems with Bounded Weights.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1999, v:33, n:1, pp:1-14 [Journal] - Stefan Ropke, David Pisinger
**A unified heuristic for a large class of Vehicle Routing Problems with Backhauls.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2006, v:171, n:3, pp:750-775 [Journal] - David Pisinger
**Heuristics for the container loading problem.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2002, v:141, n:2, pp:382-392 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] ACM Trans. Math. Softw., 2007, v:33, n:1, pp:7- [Journal] **A general heuristic for vehicle routing problems.**[Citation Graph (, )][DBLP]**Heuristic approaches for the two- and three-dimensional knapsack packing problem.**[Citation Graph (, )][DBLP]**Multi-dimensional bin packing problems with guillotine constraints.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |