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

Solutions to quadratic minimization problems with box and integer constraints

Author

Listed:
  • David Gao
  • Ning Ruan

Abstract

No abstract is available for this item.

Suggested Citation

  • David Gao & Ning Ruan, 2010. "Solutions to quadratic minimization problems with box and integer constraints," Journal of Global Optimization, Springer, vol. 47(3), pages 463-484, July.
    • Handle: RePEc:spr:jglopt:v:47:y:2010:i:3:p:463-484
    DOI: 10.1007/s10898-009-9469-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-009-9469-0
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-009-9469-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.

    Citations

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


    Cited by:

    1. Yi Chen & David Gao, 2016. "Global solutions to nonconvex optimization of 4th-order polynomial and log-sum-exp functions," Journal of Global Optimization, Springer, vol. 64(3), pages 417-431, March.
    2. 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.
    3. Jin, Zhong & Y. Gao, David, 2017. "On modeling and global solutions for d.c. optimization problems by canonical duality theory," Applied Mathematics and Computation, Elsevier, vol. 296(C), pages 168-181.
    4. Zhenbo Wang & Shu-Cherng Fang & David Gao & Wenxun Xing, 2012. "Canonical dual approach to solving the maximum cut problem," Journal of Global Optimization, Springer, vol. 54(2), pages 341-351, October.

    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:47:y:2010:i:3:p:463-484. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.