Compact linearization for binary quadratic problems

4OR

Volumn 5, Issue 3, 2007, Pages 231-245

  Liberti, Leo ^a  

^a ÉCOLE POLYTECHNIQUE   (France)

Author keywords

Binary quadratic problem; Graph partitioning; Linearization

Indexed keywords

EID: 34848888112     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-006-0015-3     Document Type: Article

References (21)

1. Allemand K, Fukuda K, Liebling TM, Steiner E.(2001) A polynomial case of unconstrained zero-one quadratic optimization. Math Program 91:49-52
2. Battiti R, Bertossi A. (1999) Greedy, prohibition and reactive heuristics for graph partitioning. IEEE Trans Comput 48(4):361-385
3. Beasley JE.(1998) Heuristic algorithms for the unconstrained binary quadratic programming problem. In: Technical report, Management School, Imperial College London
4. Billionnet A, Elloumi S, Plateau M-C. (2006) Quadratic convex reformulation: a computational study of the graph bisection problem. In: Technical report RC1003, Conservatoire National des Arts et Métiers
5. Boulle M. (2004) Compact mathematical formulation for graph partitioning. Optim Eng 5:315-333
6. Caprara A, Lancia G.(2002) Structural alignment of large-size proteins via Lagrangian relaxation. In: Proceedings of 6th RECOMB ACM Press pp 100-108.
7. Caprara A, Pisinger D, Toth P. (1999) Exact solution of the quadratic knapsack problem. INFORMS J Comput 11:125-137
8. Davidović T, Liberti L, Maculan N, Mladenović N. (2004) Mathematical programming-based approach to scheduling of communicating tasks. In: Technical Report G-2004-99, Cahiers du GERAD
9. Ferreira CE, Martin A, Carvalho de Souza C, Weismantel R, Wolsey LA. (1996) Formulations and valid inequalities for the node capacitated graph partitioning problem. Math Program 74:247-266
10. Fortet R. (1960) Applications de l'algèbre de boole en recherche opérationelle. Revue Française Recherche Opérationelle 4:17-26
11. Fourer R, Gay D. (2002) The AMPL book. Duxbury Press, Pacific Grove
12. Frieze AM, Yadegar J. (1983) On the quadratic assignment problem. Discrete Appl Math 5:89-98
13. Hammer PL, Rudeanu S. (1968) Boolean methods in operations research and related areas. Springer, Berlin, Heidelberg, New York
14. Hendrickson B, Kolda T. (2000) Partitioning rectangular and structurally nonsymmetric sparse matrices for parallel processing. SIAM J Sci Comput 21(6):2048-2072
15. ILOG (2002) ILOG CPLEX 8.0 User's Manual. ILOG S.A., Gentilly, France
16. Johnson D.S, Aragon CR, McGeoch LA, Schevon C. (1989) Optimization by simulated annealing: an experimental evaluation; part I, graph partitioning. Oper Res 37:865-892
17. Koopmans TC, Beckmann MJ. (1957) Assignment problems and the location of economic activities. Econometrica 25:53-76
18. Padberg MW, Rijal MP. (1996) Location, scheduling, design and integer programming. Kluwer, Dordrecht
19. Sherali H, Brown E.(1994) A quadratic partial assignment and packing model and algorithm for the airline gate assignment problem. In: Pardalos, P., Wolkowicz, H.: (eds) Quadratic Assignment and related problems. pp 343-364. American Mathematical Society
20. Sherali HD, Adams WP. (1986) A tight linearization and an algorithm for 0-1 quadratic programming problems. Manage Sci 32(10):1274-1290
21. Sherali HD, Lee Y. (1996) Tighter representations for set partitioning problems. Discrete Appl Math 68:153-167