IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v181y2007i2p592-597.html
   My bibliography  Save this article

Solving the maximum edge weight clique problem via unconstrained quadratic programming

Author

Listed:
  • Alidaee, Bahram
  • Glover, Fred
  • Kochenberger, Gary
  • Wang, Haibo

Abstract

No abstract is available for this item.

Suggested Citation

  • Alidaee, Bahram & Glover, Fred & Kochenberger, Gary & Wang, Haibo, 2007. "Solving the maximum edge weight clique problem via unconstrained quadratic programming," European Journal of Operational Research, Elsevier, vol. 181(2), pages 592-597, September.
    • Handle: RePEc:eee:ejores:v:181:y:2007:i:2:p:592-597
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(06)00475-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Macambira, Elder Magalhaes & de Souza, Cid Carvalho, 2000. "The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations," European Journal of Operational Research, Elsevier, vol. 123(2), pages 346-371, June.
    2. Fred Glover & Gary A. Kochenberger & Bahram Alidaee, 1998. "Adaptive Memory Tabu Search for Binary Quadratic Programs," Management Science, INFORMS, vol. 44(3), pages 336-345, March.
    3. Hunting, Marcel & Faigle, Ulrich & Kern, Walter, 2001. "A Lagrangian relaxation approach to the edge-weighted clique problem," European Journal of Operational Research, Elsevier, vol. 131(1), pages 119-131, May.
    4. Gary Kochenberger & Fred Glover & Bahram Alidaee & Cesar Rego, 2005. "An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem," Annals of Operations Research, Springer, vol. 139(1), pages 229-241, October.
    5. Gary Kochenberger & Fred Glover & Bahram Alidaee & Karen Lewis, 2005. "Using the unconstrained quadratic program to model and solve Max 2-SAT problems," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 1(1/2), pages 89-100.
    6. Sorensen, Michael M., 2004. "New facets and a branch-and-cut algorithm for the weighted clique problem," European Journal of Operational Research, Elsevier, vol. 154(1), pages 57-70, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Carvalho, Filipa D. & Almeida, M. Teresa, 2011. "Upper bounds and heuristics for the 2-club problem," European Journal of Operational Research, Elsevier, vol. 210(3), pages 489-494, May.
    2. Ammar, E.E., 2009. "On fuzzy random multiobjective quadratic programming," European Journal of Operational Research, Elsevier, vol. 193(2), pages 329-341, March.
    3. Yang Wang & Jin-Kao Hao & Fred Glover & Zhipeng Lü & Qinghua Wu, 2016. "Solving the maximum vertex weight clique problem via binary quadratic programming," Journal of Combinatorial Optimization, Springer, vol. 32(2), pages 531-549, August.
    4. Seyedmohammadhossein Hosseinian & Dalila B. M. M. Fontes & Sergiy Butenko, 2020. "A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 747-762, July.
    5. Seyedmohammadhossein Hosseinian & Dalila B. M. M. Fontes & Sergiy Butenko, 2018. "A nonconvex quadratic optimization approach to the maximum edge weight clique problem," Journal of Global Optimization, Springer, vol. 72(2), pages 219-240, October.
    6. Yi Chu & Boxiao Liu & Shaowei Cai & Chuan Luo & Haihang You, 2020. "An efficient local search algorithm for solving maximum edge weight clique problem in large graphs," Journal of Combinatorial Optimization, Springer, vol. 39(4), pages 933-954, May.
    7. Wu, Qinghua & Hao, Jin-Kao, 2013. "A hybrid metaheuristic method for the Maximum Diversity Problem," European Journal of Operational Research, Elsevier, vol. 231(2), pages 452-464.
    8. Zhou, Yi & Hao, Jin-Kao & Goëffon, Adrien, 2017. "PUSH: A generalized operator for the Maximum Vertex Weight Clique Problem," European Journal of Operational Research, Elsevier, vol. 257(1), pages 41-54.
    9. Bahram Alidaee & Haibo Wang, 2017. "A note on heuristic approach based on UBQP formulation of the maximum diversity problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(1), pages 102-110, January.
    10. Xia, Yong & Sheu, Ruey-Lin & Sun, Xiaoling & Li, Duan, 2012. "Improved estimation of duality gap in binary quadratic programming using a weighted distance measure," European Journal of Operational Research, Elsevier, vol. 218(2), pages 351-357.
    11. Immanuel M. Bomze & Michael Kahr & Markus Leitner, 2021. "Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization," Mathematics of Operations Research, INFORMS, vol. 46(1), pages 301-316, February.
    12. Lozano, M. & Molina, D. & GarcI´a-MartI´nez, C., 2011. "Iterated greedy for the maximum diversity problem," European Journal of Operational Research, Elsevier, vol. 214(1), pages 31-38, October.
    13. Teobaldo Bulhões & Anand Subramanian & Gilberto F. Sousa Filho & Lucídio dos Anjos F. Cabral, 2017. "Branch-and-price for p-cluster editing," Computational Optimization and Applications, Springer, vol. 67(2), pages 293-316, June.
    14. Rinaldi, Marco & Viti, Francesco, 2017. "Exact and approximate route set generation for resilient partial observability in sensor location problems," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 86-119.
    15. Almeida, Maria Teresa & Carvalho, Filipa D., 2014. "An analytical comparison of the LP relaxations of integer models for the k-club problem," European Journal of Operational Research, Elsevier, vol. 232(3), pages 489-498.
    16. Shing Chih Tsai, 2013. "Rapid Screening Procedures for Zero-One Optimization via Simulation," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 317-331, May.
    17. Juan Francisco Monge, 2017. "Cardinality constrained portfolio selection via factor models," Papers 1708.02424, arXiv.org.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Fred Glover & Gary Kochenberger & Rick Hennig & Yu Du, 2022. "Quantum bridge analytics I: a tutorial on formulating and using QUBO models," Annals of Operations Research, Springer, vol. 314(1), pages 141-183, July.
    2. Seyedmohammadhossein Hosseinian & Dalila B. M. M. Fontes & Sergiy Butenko, 2018. "A nonconvex quadratic optimization approach to the maximum edge weight clique problem," Journal of Global Optimization, Springer, vol. 72(2), pages 219-240, October.
    3. Alidaee, Bahram & Kochenberger, Gary & Lewis, Karen & Lewis, Mark & Wang, Haibo, 2008. "A new approach for modeling and solving set packing problems," European Journal of Operational Research, Elsevier, vol. 186(2), pages 504-512, April.
    4. Sorensen, Michael M., 2004. "New facets and a branch-and-cut algorithm for the weighted clique problem," European Journal of Operational Research, Elsevier, vol. 154(1), pages 57-70, April.
    5. Borgwardt, S. & Schmiedl, F., 2014. "Threshold-based preprocessing for approximating the weighted dense k-subgraph problem," European Journal of Operational Research, Elsevier, vol. 234(3), pages 631-640.
    6. San Segundo, Pablo & Coniglio, Stefano & Furini, Fabio & Ljubić, Ivana, 2019. "A new branch-and-bound algorithm for the maximum edge-weighted clique problem," European Journal of Operational Research, Elsevier, vol. 278(1), pages 76-90.
    7. Lourenco, Lidia Lampreia & Pato, Margarida Vaz, 2007. "The effect of strengthened linear formulations on improving the lower bounds for the part families with precedence constraints problem," European Journal of Operational Research, Elsevier, vol. 183(1), pages 181-196, November.
    8. Lü, Zhipeng & Glover, Fred & Hao, Jin-Kao, 2010. "A hybrid metaheuristic approach to solving the UBQP problem," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1254-1262, December.
    9. Michael M. Sørensen, 2004. "b-Tree Facets for the Simple Graph Partitioning Polytope," Journal of Combinatorial Optimization, Springer, vol. 8(2), pages 151-170, June.
    10. Seyedmohammadhossein Hosseinian & Dalila B. M. M. Fontes & Sergiy Butenko, 2020. "A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 747-762, July.
    11. Carvalho, Filipa D. & Almeida, M. Teresa, 2011. "Upper bounds and heuristics for the 2-club problem," European Journal of Operational Research, Elsevier, vol. 210(3), pages 489-494, May.
    12. Wang, Yang & Lü, Zhipeng & Glover, Fred & Hao, Jin-Kao, 2012. "Path relinking for unconstrained binary quadratic programming," European Journal of Operational Research, Elsevier, vol. 223(3), pages 595-604.
    13. Sørensen, Michael M., 2005. "Polyhedral Computations for the Simple Graph Partitioning Problem," CORAL Working Papers L-2005-02, University of Aarhus, Aarhus School of Business, Department of Business Studies.
    14. Sidi Mohamed Douiri & Souad Elbernoussi, 2012. "The Unconstrained Binary Quadratic Programming for the Sum Coloring Problem," Modern Applied Science, Canadian Center of Science and Education, vol. 6(9), pages 1-26, September.
    15. Martinhon, Carlos & Lucena, Abilio & Maculan, Nelson, 2004. "Stronger K-tree relaxations for the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 158(1), pages 56-71, October.
    16. Ricardo M. Lima & Ignacio E. Grossmann, 2017. "On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study," Computational Optimization and Applications, Springer, vol. 66(1), pages 1-37, January.
    17. Tao Pham Dinh & Nam Nguyen Canh & Hoai Le Thi, 2010. "An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs," Journal of Global Optimization, Springer, vol. 48(4), pages 595-632, December.
    18. Bahram Alidaee & Haibo Wang, 2017. "A note on heuristic approach based on UBQP formulation of the maximum diversity problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(1), pages 102-110, January.
    19. Gili Rosenberg & Mohammad Vazifeh & Brad Woods & Eldad Haber, 2016. "Building an iterative heuristic solver for a quantum annealer," Computational Optimization and Applications, Springer, vol. 65(3), pages 845-869, December.
    20. Abilio Lucena, 2005. "Non Delayed Relax-and-Cut Algorithms," Annals of Operations Research, Springer, vol. 140(1), pages 375-410, November.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:181:y:2007:i:2:p:592-597. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.