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

Global optimality conditions for quadratic 0-1 optimization problems

Author

Listed:
  • Wei Chen
  • Liansheng Zhang

Abstract

No abstract is available for this item.

Suggested Citation

  • Wei Chen & Liansheng Zhang, 2010. "Global optimality conditions for quadratic 0-1 optimization problems," Journal of Global Optimization, Springer, vol. 46(2), pages 191-206, February.
    • Handle: RePEc:spr:jglopt:v:46:y:2010:i:2:p:191-206
    DOI: 10.1007/s10898-009-9416-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-009-9416-0
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-009-9416-0?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. Vaithilingam Jeyakumar & Zhiyou Wu, 2007. "Conditions For Global Optimality Of Quadratic Minimization Problems With Lmi Constraints," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 24(02), pages 149-160.
    2. L.D. Iasemidis & P. Pardalos & J.C. Sackellares & D.-S. Shiau, 2001. "Quadratic Binary Programming and Dynamical System Approach to Determine the Predictability of Epileptic Seizures," Journal of Combinatorial Optimization, Springer, vol. 5(1), pages 9-26, March.
    3. Gintaras Palubeckis, 2004. "Multistart Tabu Search Strategies for the Unconstrained Binary Quadratic Optimization Problem," Annals of Operations Research, Springer, vol. 131(1), pages 259-282, 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. Xue-Gang Zhou & Xiao-Peng Yang & Bing-Yuan Cao, 2015. "Global optimality conditions for cubic minimization problems with cubic constraints," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 82(3), pages 243-264, 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. 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. Z. Wu & G. Li & J. Quan, 2011. "Global optimality conditions and optimization methods for quadratic integer programming problems," Journal of Global Optimization, Springer, vol. 51(3), pages 549-568, November.
    4. Wu, Zhiyou & Tian, Jing & Ugon, Julien & Zhang, Liang, 2015. "Global optimality conditions and optimization methods for constrained polynomial programming problems," Applied Mathematics and Computation, Elsevier, vol. 262(C), pages 312-325.
    5. Thai Doan Chuong, 2020. "Semidefinite Program Duals for Separable Polynomial Programs Involving Box Constraints," Journal of Optimization Theory and Applications, Springer, vol. 185(1), pages 289-299, April.
    6. 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.
    7. Xue-Gang Zhou & Xiao-Peng Yang & Bing-Yuan Cao, 2015. "Global optimality conditions for cubic minimization problems with cubic constraints," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 82(3), pages 243-264, December.
    8. Michele Samorani & Yang Wang & Yang Wang & Zhipeng Lv & Fred Glover, 2019. "Clustering-driven evolutionary algorithms: an application of path relinking to the quadratic unconstrained binary optimization problem," Journal of Heuristics, Springer, vol. 25(4), pages 629-642, October.
    9. X. Zheng & X. Sun & D. Li & Y. Xu, 2012. "On zero duality gap in nonconvex quadratic programming problems," Journal of Global Optimization, Springer, vol. 52(2), pages 229-242, February.
    10. Harish Palanthandalam-Madapusi & Tobin Van Pelt & Dennis Bernstein, 2009. "Matrix pencils and existence conditions for quadratic programming with a sign-indefinite quadratic equality constraint," Computational Optimization and Applications, Springer, vol. 45(4), pages 533-549, December.
    11. Z. Y. Wu & A. M. Rubinov, 2010. "Global Optimality Conditions for Some Classes of Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 145(1), pages 164-185, April.
    12. Mauri, Geraldo Regis & Lorena, Luiz Antonio Nogueira, 2012. "A column generation approach for the unconstrained binary quadratic programming problem," European Journal of Operational Research, Elsevier, vol. 217(1), pages 69-74.
    13. Wanpracha Chaovalitwongse & Oleg Prokopyev & Panos Pardalos, 2006. "Electroencephalogram (EEG) time series classification: Applications in epilepsy," Annals of Operations Research, Springer, vol. 148(1), pages 227-250, November.
    14. Guoyin Li, 2012. "Global Quadratic Minimization over Bivalent Constraints: Necessary and Sufficient Global Optimality Condition," Journal of Optimization Theory and Applications, Springer, vol. 152(3), pages 710-726, March.
    15. V. Jeyakumar & G. Li & S. Srisatkunarajah, 2014. "Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations," Journal of Global Optimization, Springer, vol. 58(1), pages 31-50, January.
    16. D. Li & X. Sun & C. Liu, 2012. "An exact solution method for unconstrained quadratic 0–1 programming: a geometric approach," Journal of Global Optimization, Springer, vol. 52(4), pages 797-829, April.
    17. Ricardo N. Liang & Eduardo A. J. Anacleto & Cláudio N. Meneses, 2022. "Data structures for speeding up Tabu Search when solving sparse quadratic unconstrained binary optimization problems," Journal of Heuristics, Springer, vol. 28(4), pages 433-479, August.
    18. 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.
    19. 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.
    20. Wu, Zhiyou & Tian, Jing & Quan, Jing & Ugon, Julien, 2014. "Optimality conditions and optimization methods for quartic polynomial optimization," Applied Mathematics and Computation, Elsevier, vol. 232(C), pages 968-982.

    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:46:y:2010:i:2:p:191-206. 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.