IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v48y2010i4p595-632.html
   My bibliography  Save this article

An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs

Author

Listed:
  • Tao Pham Dinh
  • Nam Nguyen Canh
  • Hoai Le Thi

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jglopt:v:48:y:2010:i:4:p:595-632
    DOI: 10.1007/s10898-009-9507-y
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-009-9507-y
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-009-9507-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Le An & Pham Tao, 2005. "The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization Problems," Annals of Operations Research, Springer, vol. 133(1), pages 23-46, January.
    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. Warren P. Adams & Hanif D. Sherali, 1986. "A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems," Management Science, INFORMS, vol. 32(10), pages 1274-1290, October.
    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. Gary Kochenberger & Jin-Kao Hao & Fred Glover & Mark Lewis & Zhipeng Lü & Haibo Wang & Yang Wang, 2014. "The unconstrained binary quadratic programming problem: a survey," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 58-81, July.
    2. 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.
    3. Hoai Le Thi & Tao Pham Dinh & Huynh Ngai, 2012. "Exact penalty and error bounds in DC programming," Journal of Global Optimization, Springer, vol. 52(3), pages 509-535, March.
    4. Mohand Bentobache & Mohamed Telli & Abdelkader Mokhtari, 2022. "New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming," Journal of Global Optimization, Springer, vol. 82(4), pages 659-689, April.
    5. Le Thi, H.A. & Pham Dinh, T. & Le, H.M. & Vo, X.T., 2015. "DC approximation approaches for sparse optimization," European Journal of Operational Research, Elsevier, vol. 244(1), pages 26-46.
    6. Hoai An Le Thi & Thi Tuyet Trinh Nguyen & Hoang Phuc Hau Luu, 2022. "A DC programming approach for solving a centralized group key management problem," Journal of Combinatorial Optimization, Springer, vol. 44(5), pages 3165-3193, December.
    7. Yitian Qian & Shaohua Pan & Shujun Bi, 2023. "A matrix nonconvex relaxation approach to unconstrained binary polynomial programs," Computational Optimization and Applications, Springer, vol. 84(3), pages 875-919, April.
    8. Tao Pham Dinh & Yi-Shuai Niu, 2011. "An efficient DC programming approach for portfolio decision with higher moments," Computational Optimization and Applications, Springer, vol. 50(3), pages 525-554, December.

    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. Pietro D’Alessandro & Manlio Gaudioso & Giovanni Giallombardo & Giovanna Miglionico, 2024. "The Descent–Ascent Algorithm for DC Programming," INFORMS Journal on Computing, INFORMS, vol. 36(2), pages 657-671, March.
    3. Min Tao & Jiang-Ning Li, 2023. "Error Bound and Isocost Imply Linear Convergence of DCA-Based Algorithms to D-Stationarity," Journal of Optimization Theory and Applications, Springer, vol. 197(1), pages 205-232, April.
    4. J. X. Cruz Neto & P. R. Oliveira & A. Soubeyran & J. C. O. Souza, 2020. "A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem," Annals of Operations Research, Springer, vol. 289(2), pages 313-339, June.
    5. Tao Pham Dinh & Yi-Shuai Niu, 2011. "An efficient DC programming approach for portfolio decision with higher moments," Computational Optimization and Applications, Springer, vol. 50(3), pages 525-554, December.
    6. Alain Billionnet & Sourour Elloumi & Amélie Lambert, 2013. "An efficient compact quadratic convex reformulation for general integer quadratic programs," Computational Optimization and Applications, Springer, vol. 54(1), pages 141-162, January.
    7. Joaquim Júdice, 2012. "Algorithms for linear programming with linear complementarity constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(1), pages 4-25, April.
    8. Serigne Gueye & Philippe Michelon, 2005. "“Miniaturized” Linearizations for Quadratic 0/1 Problems," Annals of Operations Research, Springer, vol. 140(1), pages 235-261, November.
    9. Hoai An Le Thi & Van Ngai Huynh & Tao Pham Dinh, 2018. "Convergence Analysis of Difference-of-Convex Algorithm with Subanalytic Data," Journal of Optimization Theory and Applications, Springer, vol. 179(1), pages 103-126, October.
    10. João Carlos O. Souza & Paulo Roberto Oliveira & Antoine Soubeyran, 2016. "Global convergence of a proximal linearized algorithm for difference of convex functions," Post-Print hal-01440298, HAL.
    11. A. B. Dieker & S. Ghosh & M. S. Squillante, 2017. "Optimal Resource Capacity Management for Stochastic Networks," Operations Research, INFORMS, vol. 65(1), pages 221-241, February.
    12. Hanif D. Sherali & Warren P. Adams & Patrick J. Driscoll, 1998. "Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems," Operations Research, INFORMS, vol. 46(3), pages 396-405, June.
    13. Yuan, Quan & Liu, Binghui, 2021. "Community detection via an efficient nonconvex optimization approach based on modularity," Computational Statistics & Data Analysis, Elsevier, vol. 157(C).
    14. Laura Girometti & Martin Huska & Alessandro Lanza & Serena Morigi, 2024. "Convex Predictor–Nonconvex Corrector Optimization Strategy with Application to Signal Decomposition," Journal of Optimization Theory and Applications, Springer, vol. 202(3), pages 1286-1325, September.
    15. Manlio Gaudioso & Giovanni Giallombardo & Giovanna Miglionico, 2022. "Essentials of numerical nonsmooth optimization," Annals of Operations Research, Springer, vol. 314(1), pages 213-253, July.
    16. Rostami, Borzou & Malucelli, Federico & Belotti, Pietro & Gualandi, Stefano, 2016. "Lower bounding procedure for the asymmetric quadratic traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 253(3), pages 584-592.
    17. Chen, Yajing & Wu, Zhimin & Wang, Yunlong, 2024. "Omnichannel product selection and shelf space planning optimization," Omega, Elsevier, vol. 127(C).
    18. Hoai Le Thi & Van Huynh & Tao Dinh & A. Vaz & L. Vicente, 2014. "Globally convergent DC trust-region methods," Journal of Global Optimization, Springer, vol. 59(2), pages 209-225, July.
    19. F. Mashkoorzadeh & N. Movahedian & S. Nobakhtian, 2022. "The DTC (difference of tangentially convex functions) programming: optimality conditions," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(2), pages 270-295, July.
    20. Gruzdeva, Tatiana V. & Strekalovsky, Alexander S., 2018. "On solving the sum-of-ratios problem," Applied Mathematics and Computation, Elsevier, vol. 318(C), pages 260-269.

    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:spr:jglopt:v:48:y:2010:i:4:p:595-632. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.