Upper bounds and exact algorithms for p-dispersion problems

Computers and Operations Research

Volumn 33, Issue 5, 2006, Pages 1380-1398

  Pisinger, David ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Branch and bound; Locational analysis; Upper bounds

Indexed keywords

COMPUTATIONAL COMPLEXITY; DISPERSIONS; LAGRANGE MULTIPLIERS; PROBLEM SOLVING; TELECOMMUNICATION;

BRANCH-AND-BOUND; LOCATION ANALYSIS; UPPER BOUNDS;

ALGORITHMS;

EID: 26444531878     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2004.09.033     Document Type: Article

References (30)

1. Asahiro Y, Iwama K, Tamaki H, Tokuyama T. Greedily finding a dense subgraph. In: Karlsson RG, Lingas A, editors. Algorithm theory - SWAT '96, 5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, July, vol. 1097. Berlin: Springer; 1996. p. 136-48.
2. Hansen P, Moon ID. Dispersing facilities on a network. Presentation at the TIMS/ORSA Joint National Meeting, Washington, D.C.; 1988.
3. E. Erkut The discrete p-dispersion problem European Journal of Operational Research 46 1990 48 60
4. S.S. Ravi, D.J. Rosenkrantz, and G.K. Tayi Heuristic and special case algorithms for dispersion problems Operations Research 42 1994 299 310
5. Kortsarz G, Peleg D. On choosing a dense subgraph. In: Proceedings of the 34th Annual IEEE Symposium on Foundation of Computer Science. New York: Institute of Electrical and Electronics Engineers; 1993. p. 692-701.
6. Srivastav A, Wolf K. Finding dense subgraphs with semidefinite programming. In: Jansen K, Rolim J, editors. Approximation algorithms for combinatorial optimization. Lecture Notes in Computer Science, vol. 1444. Berlin: Springer; 1998. p. 181-91.
7. R. Hassin, S. Rubinstein, and A. Tamir Approximation algorithms for maximum dispersion Operations Research Letters 21 1997 133 137
8. D.G. Corneil, and Y. Perl Clustering and domination in perfect graphs Discrete Applied Mathematics 9 1984 27 40
9. R.K. Kincaid Good solutions to discrete noxious location problems via metaheuristics Annals of Operations Research 40 1992 265 281
10. A. Billionnet, and A. Faye A lower bound for a constrained quadratic 0-1 minimization problem Discrete Applied Mathematics 74 1997 135 146
11. P.L. Hammer, P. Hansen, and B. Simeone Roof duality, complementation and persistency in quadratic 0-1 optimization Mathematical Programming 28 1984 121 155
12. Y. Asahiro, R. Hassin, and K. Iwama Complexity of finding dense subgraphs Discrete Applied Mathematics 121 1-3 2002 15 26
13. P. Michelon, and L. Veilleux Lagrangean methods for the 0-1 quadratic knapsack problem European Journal of Operational Research 92 1996 326 341
14. P.L. Hammer, and D.J. Rader Jr. Efficient methods for solving quadratic 0-1 knapsack problems INFOR 35 1997 170 182
15. A. Billionnet, A. Faye, and E. Soutif A new upper bound for the 0-1 quadratic knapsack problem European Journal of Operational Research 112 1999 664 672
16. Pisinger D, Rasmussen AB, Sandvik R. Solution of large-sized quadratic knapsack problems through aggressive reduction. INFORMS Journal on Computing, 2005, to appear.
17. A. Caprara, D. Pisinger, and P. Toth Exact solution of the quadratic knapsack problem INFORMS Journal on Computing 11 1999 125 137
18. J. Krarup, D. Pisinger, and F. Plastria Discrete location problems with push-pull objectives Discrete Applied Mathematics 123 2002 363 378
19. G. Gallo, P.L. Hammer, and B. Simeone Quadratic knapsack problems Mathematical Programming 12 1980 132 149
20. P. Carraresi, and F. Malucelli A reformulation scheme and new lower bounds for the qap P.M. Pardalos H. Wolkowicz Quadratic assignment and related problems 1994 American Mathematical Society Press Providence, RI 147 160
21. M. Held, and R.M. Karp The traveling salesman problem and minimum spanning trees Part ii Mathematical Programming 1 1971 6 25
22. Chaillou P, Hansen P, Mahieu Y. Best network flow bound for the quadratic knapsack problem. In: Simeone B, editor. Combinatorial optimization. Lecture Notes in Mathematics, vol. 1403. Berlin: Springer; 1986. p. 225-35.
23. A.M. Geoffrion Lagrangian relaxation for integer programming Mathematical Programming Study 2 1974 82 114
24. A.V. Karzanov Determining the maximal flow in a network by the method of preflow Soviet Mathematics Doklady 15 1974 434 437
25. C. Helmberg, F. Rendl, and R. Weismantel Quadratic knapsack relaxations using cutting planes and semidefinite programming Lecture Notes in Computer Science vol. 1084 1996 175 189
26. C. Helmberg, F. Rendl, and R. Weismantel A semidefinite programming approach to the quadratic knapsack problem Journal of Combinatorial Optimization 4 2000 197 215
27. H. Kellerer, U. Pferschy, and D. Pisinger Knapsck problems 2004 Springer Berlin
28. A. Billionnet, and F. Calmels Linear programming for the 0-1 quadratic knapsack problem European Journal of Operational Research 92 1996 310 325
29. Johnson DS, Trick MA, editors. Cliques, coloring and satisfiability: 2nd DIMACS implementation challenge. DIMACS Series in: Discrete Mathematics and Theoretical Computer Science. Providence, RI: American Mathematical Society Press; 1996.
30. Pisinger D. Exact Solution of p-dispersion problems, Technical Report 99/14, DIKU, University of Copenhagen, Denmark; 1999.