Publications by David Pisinger
•
Classified by Publication Type •
Sorted by Year •
Classified by Author •
Classified by Author
•
Egeblad, J.
•
Jepsen, M.
•
Krarup, J.
•
Petersen, B.
•
Pisinger, D.
•
Spoorendonk, S.
•
Zachariasen, M.
•
Egeblad, J.
Jepsen, M.
- M. Jepsen, B. Petersen, S. Spoorendonk,
and D. Pisinger. Subset-Row Inequalities Applied to the Vehicle Routing Problem
with Time Windows. Operations Research, 56(2):497–511, 2008. [BibTeX] [Google] [doi]
- M. Jepsen, B. Petersen, S. Spoorendonk,
and D. Pisinger. A non-robust Branch-and-Cut-and-Price algorithm for the
Vehicle Routing Problem with Time Windows. Technical Report 06-03, DIKU, University of Copenhagen, Denmark,
2006. [BibTeX] [Google] [pdf]
Krarup, J.
- J. Krarup and D. Pisinger. The EURO 2000 feature issue of CEJOR. Central
European Journal of Operations Research, 10:1–2, 2002. [BibTeX] [Google]
- J. Krarup and D. Pisinger. The EURO 2000 feature issue of EJOR. European
Journal of Operational Research, 140:167–169, 2002. [BibTeX] [Google]
- J. Krarup, D. Pisinger, and F. Plastria. Discrete location problems with push-pull
objectives. Discrete Applied Mathematics, 123:363–378, 2002. [BibTeX] [Google]
Petersen, B.
- M. Jepsen, B. Petersen, S. Spoorendonk,
and D. Pisinger. Subset-Row Inequalities Applied to the Vehicle Routing Problem
with Time Windows. Operations Research, 56(2):497–511, 2008. [BibTeX] [Google] [doi]
- B. Petersen, D. Pisinger, and S.
Spoorendonk. Chvátal-Gomory Rank-1 Cuts used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem
with Time Windows. In B. Golden, R. Raghavan, and E. Wasil, editors, The Vehicle Routing Problem: Latest Advances and
New Challenges, pp. 397–420, Springer, 2008. [BibTeX] [Google] [doi]
- M. Jepsen, B. Petersen, S. Spoorendonk,
and D. Pisinger. A non-robust Branch-and-Cut-and-Price algorithm for the
Vehicle Routing Problem with Time Windows. Technical Report 06-03, DIKU, University of Copenhagen, Denmark,
2006. [BibTeX] [Google] [pdf]
Pisinger, D.
- J. Egeblad and D. Pisinger. Heuristic
approaches for the two- and three-dimensional knapsack packing problems. Computers and Operations Research, 36:1026–1049,
2009. [BibTeX] [Google]
- M. Jepsen, B. Petersen, S. Spoorendonk,
and D. Pisinger. Subset-Row Inequalities Applied to the Vehicle Routing Problem
with Time Windows. Operations Research, 56(2):497–511, 2008. [BibTeX] [Google] [doi]
- B. Petersen, D. Pisinger, and S.
Spoorendonk. Chvátal-Gomory Rank-1 Cuts used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem
with Time Windows. In B. Golden, R. Raghavan, and E. Wasil, editors, The Vehicle Routing Problem: Latest Advances and
New Challenges, pp. 397–420, Springer, 2008. [BibTeX] [Google] [doi]
- Silvano Martello, David Pisinger, Daniele Vigo, Edgar Den Boef, and Jan Korst.
Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem. ACM Transactions
on Mathematical Software, 33(1):7, ACM Press, New York, NY, USA, 2007. [BibTeX] [Google] [doi]
- D. Pisinger and M. M. Sigurd. Using Decomposition Techniques and Constraint
Programming for Solving the Two-Dimensional Bin Packing Problem. INFORMS Journal on Computing, 19(1):36–51,
2007. [BibTeX] [Google]
- D. Pisinger, A.Bo Rasmussen, and R. Sandvik. Solution of large-sized quadratic
knapsack problems through aggressive reduction. INFORMS Journal on Computing, 19(2):280–290,
2007. [BibTeX] [Google]
- D. Pisinger. Denser packings obtained in O(n log log n) time. INFORMS
Journal on Computing, 19(3):395–405, 2007. [BibTeX] [Google]
- D. Pisinger and S. Ropke. A general heuristic for vehicle routing problems.
Computers & Operations Research, 34:2403–2435, 2007. [BibTeX] [Google]
- D. Pisinger. The Quadratic Knapsack Problem --- a survey. Discrete Applied
Mathematics, 155:623–648, 2007. [BibTeX] [Google]
- L. Blander Reinhardt and D. Pisinger. Multi-Objective Non-Additive Shortest
Path Problems. Unpublished 2007. submitted [BibTeX] [Google]
- M. Jepsen, B. Petersen, S. Spoorendonk,
and D. Pisinger. A non-robust Branch-and-Cut-and-Price algorithm for the
Vehicle Routing Problem with Time Windows. Technical Report 06-03, DIKU, University of Copenhagen, Denmark,
2006. [BibTeX] [Google] [pdf]
- D. Pisinger. Upper bounds and exact algorithms for p-dispersion problems.
Computers & Operations Research, 33:1380–1398, 2006. [BibTeX] [Google]
- S. Ropke and D. Pisinger. A unified heuristic for vehicle routing problems
with backhauls. European Journal of Operational Research, 171:750–775, 2006. [BibTeX] [Google]
- S. Ropke and D. Pisinger. An Adaptive Large Neighborhood Search Heuristic for
the Pickup and Delivery Problem with Time Windows. Transportation Science, 40:455–472, 2006. [BibTeX] [Google]
- E. den Boef, J. Korst, S. Martello, D. Pisinger, and D. Vigo. Erratum to `The
Three-Dimensional Bin Packing Problem': Robot-Packable and Orthogonal Variants of Packing Problems. Operations
Research, 53:735–736, 2005. [BibTeX] [Google]
- T. Clausen, A. Hjorth, M. Nielsen, and D. Pisinger. The Off-line Group Seat
Reservation Problem. Unpublished 2005. submitted [BibTeX] [Google]
- D. Pisinger. Where are the hard knapsack problems?. Computers & Operations
Research, 32:2271–2282, 2005. [BibTeX] [Google]
- D. Pisinger and M. M. Sigurd. The two-dimensional bin packing problem with
variable bin sizes and costs. Discrete Optimization, 2:154–167, 2005. [BibTeX] [Google]
- H. Kellerer, U. Pferschy, and D. Pisinger. Knapsack Problems, Springer,
Berlin, Germany, 2004. [BibTeX] [Google]
- D. Pisinger, A.Bo Rasmussen, and R. Sandvik. Solution of large-sized quadratic
knapsack problems through aggressive reduction. Technical Report 04-11, DIKU, University of Copenhagen,
Denmark, 2004. [BibTeX] [Google] [pdf]
- S. Ropke and D. Pisinger. An Adaptive Large Neighborhood Search Heuristic for
the Pickup and Delivery Problem with Time Windows. Technical Report 04-13, DIKU, University of Copenhagen,
Denmark, 2004. [BibTeX] [Google] [pdf]
- S. Ropke and D. Pisinger. A unified heuristic for vehicle routing problems
with backhauls. Technical Report 04-14, DIKU, University of Copenhagen, Denmark, 2004. [BibTeX] [Google] [pdf]
- M. Sigurd, D. Pisinger, and M. Sig. Scheduling Transportation of Live Animals
to Avoid Speard of Diseases. INFORMS transportation science, 38:197–209, 2004. [BibTeX] [Google]
- Edgar den Boef, Jan Korst, Silvano Martello, David Pisinger, and Daniele Vigo.
A note on Robot-packable and Orthogonal variants of the three-dimensional bin packing problem. Technical Report
03-02, DIKU, University of Copenhagen, Denmark, 2003. [BibTeX] [Google] [pdf]
- J. Egeblad and D. Pisinger. Heuristic
approaches for the two- and three-dimensional knapsack packing problems. Technical Report 06-13, DIKU, University of Copenhagen,
Denmark, 2003. [BibTeX] [Google] [pdf]
- O. Faroe, D. Pisinger, and M. Zachariasen.
Guided Local search for final placement in VLSI-design. Journal of Heuristics, 9:269–295, 2003. [BibTeX] [Google]
- O. Faroe, D. Pisinger, and M. Zachariasen.
Guided Local Search for the Three-Dimensional Bin Packing Problem. INFORMS Journal on Computing,
15:267–283, 2003. [BibTeX] [Google]
- D. Pisinger. Dynamic Programming on the word RAM. Algorithmica,
35:128–145, 2003. [BibTeX] [Google]
- D. Pisinger. Where are the hard knapsack problems?. Technical Report 03-08,
DIKU, University of Copenhagen, Denmark, 2003. [BibTeX] [Google] [pdf]
- D. Pisinger and M.M. Sigurd. Using Decomposition Techniques and Constraint
Programming for Solving the Two-dimensional Bin Packing Problem. Technical Report 03-01, DIKU, University of Copenhagen,
Denmark, 2003. [BibTeX] [Google] [pdf]
- J. Krarup and D. Pisinger. The EURO 2000 feature issue of CEJOR. Central
European Journal of Operations Research, 10:1–2, 2002. [BibTeX] [Google]
- J. Krarup and D. Pisinger. The EURO 2000 feature issue of EJOR. European
Journal of Operational Research, 140:167–169, 2002. [BibTeX] [Google]
- J. Krarup, D. Pisinger, and F. Plastria. Discrete location problems with push-pull
objectives. Discrete Applied Mathematics, 123:363–378, 2002. [BibTeX] [Google]
- D. Pisinger. Heuristics for the container loading problem. European
Journal of Operational Research, 141:382–392, 2002. [BibTeX] [Google]
- O. Faroe, D. Pisinger, and M. Zachariasen.
Local search for final placement in VLSI-design. In Proceedings of the IEEE/ACM International Conference on
Computer Aided Design (ICCAD), San Jose, California, pp. 565–572, 2001. [BibTeX] [Google] [pdf]
- Faroe, D. Pisinger, and M. Zachariasen.
Local search for final placement in VLSI-design. Technical Report 01-01, DIKU, University of Copenhagen, Denmark, 2001. [BibTeX] [Google] [pdf]
- T. Illes and D. Pisinger. Upper bounds on the covering number of Galois-planes
with small order. Journal of Heuristics, 7:59–76, 2001. [BibTeX] [Google]
- D. Pisinger. Budgeting with bounded multiple-choice constraints. European
Journal of Operational Research, 129:471–480, 2001. [BibTeX] [Google]
- A. Caprara, H. Kellerer, U. Pferschy, and D. Pisinger. Approximation algorithms
for knapsack problems with cardinality constraints. European Journal of Operational Research, 123:333–345,
2000. [BibTeX] [Google]
- S. Martello, D. Pisinger, and D. Vigo. The Three-Dimensional Bin Packing Problem.
Operations Research, 48:256–267, 2000. [BibTeX] [Google]
- S. Martello, D. Pisinger, and P. Toth. New trends in exact algorithms for the
0-1 knapsack problem. European Journal of Operational Research, 123:325–332, 2000. [BibTeX] [Google]
- S. Martello, D. Pisinger, and P. Toth. Nouvelles tendances pour les algorithmes
exacts du problème de Sac à Dos en 0-1. Optimisation et decision, actes des deuxièmes
Journées Francophones de Recherche Opérationnelle, pp. 41–50, 2000. [BibTeX] [Google]
- S.R. Nielsen, D. Pisinger, and P. Marquardsen. Automatic Transformation of
Constraint Satisfaction Problems to Integer Linear Form --- an Experimental Study. In Proceedings of
TRICS, Techniques foR Implementing Constraint programming Systems, a post-conference workshop of CP 2000, Technical
Report, TRA9/00, School of Computing, National University of Singapore, 2000. [BibTeX] [Google] [ps]
- D. Pisinger. A minimal algorithm for the Bounded Knapsack Problem. INFORMS
Journal on Computing, 34:75–84, 2000. [BibTeX] [Google]
- D. Pisinger. Dynamic programming on the word RAM. Technical Report 00-07,
DIKU, University of Copenhagen, Denmark, 2000. [BibTeX] [Google] [ps]
- M. Sigurd, D. Pisinger, and M. Sig. The Pickup and Delivery Problem with Time
Windows and Precendences. Technical Report 00-08, DIKU, University of Copenhagen, Denmark, 2000. [BibTeX] [Google] [pdf]
- A. Caprara, D. Pisinger, and P. Toth. Exact solution of the Quadratic Knapsack
Problem. INFORMS Journal on Computing, 11:125–137, 1999. [BibTeX] [Google]
- O. Faroe, D. Pisinger, and M. Zachariasen.
Guided local search for the three-dimensional bin packing problem. Technical Report 99-13, DIKU, University
of Copenhagen, Denmark, 1999. [BibTeX] [Google] [pdf]
- S. Martello, D. Pisinger, and P. Toth. Dynamic programming and strong bounds
for the 0-1 knapsack problem. Management Science, 45:414–424, 1999. [BibTeX] [Google]
- D. Pisinger. Core problems in knapsack algorithms. Operations Research,
47:570–575, 1999. [BibTeX] [Google]
- D. Pisinger. Linear time algorithms for knapsack problems with bounded
weights. Journal of Algorithms, 33:1–14, 1999. [BibTeX] [Google]
- D. Pisinger. An exact algorithm for large multiple knapsack problems. European
Journal of Operational Research, 114:528–541, 1999. [BibTeX] [Google] [ps]
- D. Pisinger. Exact solution of p-dispersion problems. Technical Report
99-14, DIKU, University of Copenhagen, Denmark, 1999. [BibTeX] [Google] [pdf]
- A. Caprara, H. Kellerer, U. Pferschy, and D. Pisinger. Approximation Algorithms
for Knapsack Problem with Cardinality Constraints. Technical Report 98-4, DIKU, University of Copenhagen,
Denmark, 1998. [BibTeX] [Google] [ps.gz]
- A. Caprara, D. Pisinger, and P. Toth. Exact Solution of the Quadratic Knapsack
Problem. Technical Report 98-21, DIKU, University of Copenhagen, Denmark, 1998. [BibTeX] [Google] [ps.gz]
- D. Pisinger. A tree search heuristic for the container loading problem.
Ricerca Operativa, 28:31–48, 1998. [BibTeX] [Google] [pdf]
- D. Pisinger and P. Toth. Knapsack Problems. In D.Z. Du and P. Pardalos,
editors, Handbook of Combinatorial Optimization, pp. 299–428, Kluwer, 1998. [BibTeX] [Google]
- D. Pisinger. A fast algorithm for strongly correlated knapsack problems.
Discrete Applied Mathematics, 89:197–212, 1998. [BibTeX] [Google]
- D. Pisinger. ECCO-XI, Conference Program and Abstracts. DIKU, University
of Copenhagen, Denmark, 1998. [BibTeX] [Google]
- D. Pisinger. Budgeting with bounded multiple-choice constraints. Technical
Report 98-3, DIKU, University of Copenhagen, Denmark, 1998. [BibTeX] [Google] [pdf]
- A. Caprara, H. Kellerer, U. Pferschy, and D. Pisinger. Approximation Algorithms
for Knapsack Problem with Cardinality Constraints. Technical Report 97-13, DEIS - University of Bologna,
Italy, 1997. [BibTeX] [Google]
- A. Caprara, D. Pisinger, and P. Toth. Exact Solution of the Quadratic Knapsack
Problem. Technical Report 97-14, DEIS - University of Bologna, Italy, 1997. [BibTeX] [Google]
- C.C. Caroe and D. Pisinger. NOAS'97 Proceedings. DIKU, University of Copenhagen,
Denmark, 1997. [BibTeX] [Google]
- T. Illes and D. Pisinger. Upper bounds on the covering number of Galois-planes
with small order. Technical Report 97-13, DIKU, University of Copenhagen, Denmark, 1997. [BibTeX] [Google] [ps.gz]
- S. Martello, D. Pisinger, and P. Toth. Dynamic programming and tight bounds
for the 0-1 knapsack problems. Technical Report 97-11, DIKU, University of Copenhagen, Denmark, 1997. [BibTeX] [Google] [pdf]
- S. Martello, D. Pisinger, and P. Toth. New trends in exact algorithms for the
0-1 knapsack problem. Technical Report 97-10, DIKU, University of Copenhagen, Denmark, 1997. [BibTeX] [Google] [ps.gz]
- S. Martello, D. Pisinger, and D. Vigo. The Three-Dimensional Bin Packing Problem.
Technical Report 97-6, DEIS - University of Bologna, Italy, 1997. [BibTeX] [Google]
- U. Pferschy, D. Pisinger, and G.J. Woeginger. Simple but efficient approaches
for the collapsing knapsack problem. Discrete Applied Mathematics, 77:271–280, 1997. [BibTeX] [Google]
- D. Pisinger. A minimal algorithm for the 0-1 knapsack problem. Operations
Research, 45:758–767, 1997. [BibTeX] [Google]
- D. Pisinger. The container loading problem. In Proceedings NOAS'97,
pp. 15–16, 1997. [BibTeX] [Google]
- D. Pisinger. Strongly correlated Knapsack Problems are trivial to solve.
Technical Report 96-29, DIKU, University of Copenhagen, Denmark, 1996. [BibTeX] [Google] [ps]
- M.H. Bjorndal, A. Caprara, P.I. Cowling, F. Della Croce, H. Lourenco, F. Malucelli, A.J. Orman, D.
Pisinger, C. Rego, and J.J. Salazar. Some Thoughts on Combinatorial Optimization. European Journal of Operational
Research, 83:253–270, 1995. [BibTeX] [Google]
- U. Pferschy, D. Pisinger, and G.J. Woeginger. Simple but Efficient Approaches
for the Collapsing Knapsack Problem. Technical Report 95-32, University of Technology, Graz, Austria, 1995. [BibTeX] [Google]
- D. Pisinger. A minimal algorithm for the Multiple-choice Knapsack Problem.
European Journal of Operational Research, 83:394–410, 1995. [BibTeX] [Google]
- D. Pisinger. An expanding-core algorithm for the exact 0-1 knapsack problem.
European Journal of Operational Research, 87:175–187, 1995. [BibTeX] [Google] [ps]
- D. Pisinger. Avoiding anomalies in the MT2 algorithm by Martello and Toth.
European Journal of Operational Research, 82:206–208, 1995. [BibTeX] [Google]
- D. Pisinger. A minimal algorithm for the Bounded Knapsack Problem. In Integer
Programming and Combinatorial Optimization, Fourth IPCO conference, pp. 95–109, Springer, Berlin,
1995. [BibTeX] [Google]
- D. Pisinger. Algorithms for Knapsack Problems. Ph.D. Thesis, DIKU, University
of Copenhagen, Denmark, 1995. Technical Report 95-1 [BibTeX] [Google] [pdf]
- D. Pisinger. A minimal algorithm for the Bounded Knapsack Problem. Integer
Programming and Combinatorial Optimization, Fourth IPCO conference, 920:95–109, Lecture Notes in
Computer Science, Springer, Berlin, 1995. [BibTeX] [Google]
- D. Pisinger. The Multiple Loading Problem. In Proceedings NOAS'95,
pp. 18–19, 1995. [BibTeX] [Google]
- D. Pisinger. An O(nr) Algorithm for the Subset-sum Problem. Technical Report
95-6, DIKU, University of Copenhagen, Denmark, 1995. [BibTeX] [Google] [ps]
- D. Pisinger. Algorithms for Knapsack Problems. Technical Report 95-1, DIKU,
University of Copenhagen, Denmark, 1995. Ph.D. thesis [BibTeX] [Google] [pdf]
- D. Pisinger. Dominance relations in unbounded knapsack problems. Technical
Report 94-33, DIKU, University of Copenhagen, Denmark, 1994. [BibTeX] [Google] [pdf]
- D. Pisinger. Solving hard knapsack problems. Technical Report 94-24, DIKU,
University of Copenhagen, Denmark, 1994. [BibTeX] [Google] [pdf]
- D. Pisinger. A minimal algorithm for the 0-1 Knapsack Problem. Technical
Report 94-23, DIKU, University of Copenhagen, Denmark, 1994. [BibTeX] [Google] [ps]
- D. Pisinger. A minimal algorithm for the Multiple-choice Knapsack Problem.
Technical Report 94-25, DIKU, University of Copenhagen, Denmark, 1994. [BibTeX] [Google] [ps]
- D. Pisinger. Core problems in Knapsack Algorithms. Technical Report 94-26,
DIKU, University of Copenhagen, Denmark, 1994. [BibTeX] [Google] [ps]
- D. Pisinger. A minimal algorithm for the Bounded Knapsack Problem. Technical
Report 94-27, DIKU, University of Copenhagen, Denmark, 1994. [BibTeX] [Google] [ps]
- D. Pisinger. On the solution of 0-1 knapsack problems with minimal preprocessing.
In Proceedings NOAS'93, pp. 11–12, 1993. [BibTeX] [Google]
Spoorendonk, S.
- M. Jepsen, B. Petersen, S. Spoorendonk,
and D. Pisinger. Subset-Row Inequalities Applied to the Vehicle Routing Problem
with Time Windows. Operations Research, 56(2):497–511, 2008. [BibTeX] [Google] [doi]
- B. Petersen, D. Pisinger, and S.
Spoorendonk. Chvátal-Gomory Rank-1 Cuts used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem
with Time Windows. In B. Golden, R. Raghavan, and E. Wasil, editors, The Vehicle Routing Problem: Latest Advances and
New Challenges, pp. 397–420, Springer, 2008. [BibTeX] [Google] [doi]
- M. Jepsen, B. Petersen, S. Spoorendonk,
and D. Pisinger. A non-robust Branch-and-Cut-and-Price algorithm for the
Vehicle Routing Problem with Time Windows. Technical Report 06-03, DIKU, University of Copenhagen, Denmark,
2006. [BibTeX] [Google] [pdf]
Zachariasen, M.
- O. Faroe, D. Pisinger, and M. Zachariasen.
Guided Local search for final placement in VLSI-design. Journal of Heuristics, 9:269–295, 2003. [BibTeX] [Google]
- O. Faroe, D. Pisinger, and M. Zachariasen.
Guided Local Search for the Three-Dimensional Bin Packing Problem. INFORMS Journal on Computing,
15:267–283, 2003. [BibTeX] [Google]
- O. Faroe, D. Pisinger, and M. Zachariasen.
Local search for final placement in VLSI-design. In Proceedings of the IEEE/ACM International Conference on
Computer Aided Design (ICCAD), San Jose, California, pp. 565–572, 2001. [BibTeX] [Google] [pdf]
- Faroe, D. Pisinger, and M. Zachariasen.
Local search for final placement in VLSI-design. Technical Report 01-01, DIKU, University of Copenhagen, Denmark, 2001. [BibTeX] [Google] [pdf]
- O. Faroe, D. Pisinger, and M. Zachariasen.
Guided local search for the three-dimensional bin packing problem. Technical Report 99-13, DIKU, University
of Copenhagen, Denmark, 1999. [BibTeX] [Google] [pdf]
Generated by
bib2html.pl
(written by Patrick Riley
) on
Mon Nov 24, 2008 13:45:00