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
  • Search
  • An improved algorithm to test...
  • More details
Cover Image

An improved algorithm to test copositivity

Year of publication:
2012
Authors: Sponsel, Julia ; Bundfuss, Stefan ; Dür, Mirjam
Published in:
Journal of Global Optimization. - Springer. - Vol. 52.2012, 3, p. 537-551
Publisher: Springer
Subject: Copositive matrices | Maximum clique problem | Standard quadratic program | Semidefinite programming
Saved in:
  • More details
Extent:
text/html
Type of publication: Article
Source:
RePEc - Research Papers in Economics
Persistent link: https://www.econbiz.de/10010994039
    • EndNote
    • BibTeX
    • Zotero, Mendeley, RefWorks, ...
    • Text
Saved in favorites
    Similar items by subject
    • Dealing with inequality constraints in large-scale semidefinite relaxations for graph coloring and maximum clique problems

      Battista, Federico, (2025)

    • Numerical experiments with LP formulations of the maximum clique problem

      Kardos, Dóra, (2022)

    • On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem

      Li, Chu-Min, (2017)

    • More ...
    Similar items by person
    • An improved algorithm to test copositivity

      Sponsel, Julia, (2012)

    • Special issue on papers presented at the XXII EURO MC "Continuous Optimization and Knowledge-Based Decisions" : [conference held in Neringa (20 - 23 May 2008)]

      Dür, Mirjam, (2010)

    • A parametric characterization of local optimality

      Dür, Mirjam, (2003)

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

    Loading...