EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Solutions to quadratic minimiz...
  • More details
Cover Image

Solutions to quadratic minimization problems with box and integer constraints

Year of publication:
2010
Authors: Gao, David ; Ruan, Ning
Published in:
Journal of Global Optimization. - Springer. - Vol. 47.2010, 3, p. 463-484
Publisher: Springer
Subject: Canonical duality theory | Quadratic programming | Integer programming | NP-hard problems | Global optimization
Saved in:
  • More details
Extent:
text/html
Type of publication: Article
Source:
RePEc - Research Papers in Economics
Persistent link: https://www.econbiz.de/10008456024
    • EndNote
    • BibTeX
    • Zotero, Mendeley, RefWorks, ...
    • Text
Saved in favorites
    Similar items by subject
    • A canonical dual approach for solving linearly constrained quadratic programs

      Xing, Wenxun, (2012)

    • A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations

      Buchheim, Christoph, (2015)

    • Using SVM to combine global heuristics for the Standard Quadratic Problem

      Dellepiane, Umberto, (2015)

    • More ...
    Similar items by person
    • Solutions and optimality criteria for nonconvex quadratic-exponential minimization problem

      Gao, David, (2008)

    • Solutions and optimality criteria for nonconvex quadratic-exponential minimization problem

      Gao, David, (2008)

    • Solutions and optimality criteria for nonconvex quadratic-exponential minimization problem

      Gao, David Yang, (2008)

    • More ...
    A service of the
    zbw
    • Sitemap
    • Plain language
    • Accessibility
    • Contact us
    • Imprint
    • Privacy

    Loading...