Different formulations for solving the heaviest k-subgraph problem

INFOR

Volumn 43, Issue 3, 2005, Pages 171-186

  Billionnet, Alain ^a  

^a CEDRIC   (France)

Author keywords

Experiments; Heaviest k subgraph problem; Mixed integer linear programming; Upper bounds

Indexed keywords

GRAPH THEORY; LINEAR PROGRAMMING; OPTIMIZATION;

HEAVIEST K-SUBGRAPH PROBLEMS; MIXED INTEGER LINEAR PROGRAMMING; UPPER BOUNDS;

PROBLEM SOLVING;

EID: 25444493392     PISSN: 03155986     EISSN: None     Source Type: Journal    
DOI: 10.1080/03155986.2005.11732724     Document Type: Article

References (27)

1. AMPL, A Modeling Language for Mathematical Programming by R. Fourer, D.M. Gay and B.W. Kerni-ghan, The Scientific Press Series, Boyd & Fraser Publishing Company, Danvers, MA, USA, 1993.
2. W.P. Adams and H.D. Sherali. A tight linearization and an algorithm for zero-one quadratic programming problems. Management Science, vol. 32, no 10, October 1986, 1274-1290.
3. th Scandinavian Workshop on Algorithm Theory. Lectures notes in Computer Science, 1097, Springer-Verlag, 1996, 136-148.
4. E.M.L. Beale. Introduction to optimization, Willey, New-York, 1988, 121 p.
5. A. Billionnet and A. Faye. A lower bound for a constrained quadratic 0-1 minimization problem. Discrete Applied Mathematics, 74, 1997, 135-146.
6. A. Billionnet and F. Calmels. Linear programming for the 0-1 quadratic knapsack problem. Eiuopean Journal of Operational Research, 92, 1996, 310-325.
7. A. Billionnet, and E. Soutif. An exact method based on lagrangian decomposition for the 0-1 quadratic knapsack problem. European Journal of Operational Research, 157/3, 2004, 565-575.
8. A. Billionnet and F. Roupin. Approximation of the heaviest k-subgraph problem using linear programming. Research Report CEDRIC No. 486, Conservatoire National des Arts et Métiers, Paris, 2003.
9. A. Caprara, D. Pisinger and P. Toth. Exact solution of the quadratic knapsack problem, INFORMS Journal on Computing, 11, 1999, 125-137.
10. D.G. Corneil and Y. Perl. Clustering and domination in perfect graphs. Discrete Applied Mathematics, vol. 9, No. 1, 1984, 27-39.
11. E. Erkut. The discrete p-dispersion problem. European Journal of Operational Research, 46, 1990, 46-80.
12. A. Faye. Contributions à la programmation quadratique en 0-1, Habilitation à diriger des recherches de l'Université Paris-Nord, 2003.
13. A. Faye and Q. Trinh. Polyhedral results for a constrained quadratic 0-1 problem. Research Report CEDRIC, Conservatoire National des Arts et Métiers, Paris, 2003, to appear in Discrete Applied Mathematics.
14. A.M. Frieze and J. Yadegar. On the quadratic assignment problem. Discrete Applied mathematics, 5, 1983, 89-98.
15. F. Glover. Improved linear integer programming formulations of nonlinear integer problems, Management Science, vol. 22, 1975, 455-460.
16. P.L. Hammer, P. Hansen and B. Simeone. Roof duality, complementation and persistency in quadratic 0-1 optimization. Math. Programming, 28, 1984, 121-155.
17. P.L. Hammer and D.J. Rader. Efficient methods for solving 0-1 quadratic knapsack problems. INFOR 35, No. 3, 1997, 170-182.
18. R. Hassin, S. Rubinstein and A. Tamir. Approximation algorithms for maximum dispersion. Operations Research Letters, 1997, 133-137.
19. ILOG, CPLEX 8.0 Reference manual. ILOG CPLEX Division, Gentilly, France, 2002.
20. H. Kellerer, U. Pferschy and D. Pisinger. Knapsack problems, Springer, 2004.
21. R.K. Kincaid. Good solutions to discrete noxious location problems via metaheuristics. Annals of Operations Research, 40, 1992, 265-281.
22. th Annual IEEE Symposium on Foundations of Computer Science, 1993, 692-701.
23. J. Krarup, D. Pisinger and F. Plastria. Discrete location problems with push-pull objectives. Discrete Applied Mathematics 123, 2002, 363-378.
24. D. Pisinger. Exact solution of p-dispersion problems. Technical Report 99/14, DIKU, University of Copenhagen, Denmark, 1999.
25. J. Rhys. A selection problem of shared fixed costs and networks. Management science 17, 1970, 200-207.
26. H.M. Salkin and K. Mathur. Foundation of integer programming, North-Holland, Amsterdam, 1989, 755 p.
27. A. Srivastav and K. Wolf. Finding dense subgraph with semidefiinite programming. In Approximation Algorithms for Combinatorial Optimization, K. Jansen and J. Rolim (Eds.), 1998, 181-191.