Sciweavers

    177 search results - page 1 / 36
    » Semidefinite Programming Relaxations for the Quadratic Assig...
    Sort
    View
    MP
    2010
    132views more  MP 2010»
    Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
    13 years 5 months ago
    Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
    Download  www.optimization-online.org
    We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the b...
    Etienne de Klerk, Renata Sotirov
    claim paper
    Read More »
    JCO
    1998
    80views more  JCO 1998»
    Semidefinite Programming Relaxations for the Quadratic Assignment Problem
    13 years 10 months ago
    Semidefinite Programming Relaxations for the Quadratic Assignment Problem
    Download  www.diku.dk
    Qing Zhao, Stefan E. Karisch, Franz Rendl, Henry W...
    claim paper
    Read More »
    MP
    2006
    113views more  MP 2006»
    On the gap between the quadratic integer programming problem and its semidefinite relaxation
    13 years 11 months ago
    On the gap between the quadratic integer programming problem and its semidefinite relaxation
    Download  www.staff.city.ac.uk
    Consider the semidefinite relaxation (SDR) of the quadratic integer program (QIP): := maxx{-1,1}n xT Qx minD-Q 0 trace(D) =:
    U. Malik, Imad M. Jaimoukha, G. D. Halikias, S. K....
    claim paper
    Read More »
    CVPR
    2007
    IEEE
    147views Computer Vision» more  CVPR 2007»
    Solving Large Scale Binary Quadratic Problems: Spectral Methods vs. Semidefinite Programming
    15 years 1 months ago
    Solving Large Scale Binary Quadratic Problems: Spectral Methods vs. Semidefinite Programming
    Download  www.maths.lth.se
    In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
    Carl Olsson, Anders P. Eriksson, Fredrik Kahl
    claim paper
    Read More »
    MP
    2007
    81views more  MP 2007»
    On approximating complex quadratic optimization problems via semidefinite programming relaxations
    13 years 10 months ago
    On approximating complex quadratic optimization problems via semidefinite programming relaxations
    Download  www.stanford.edu
    Anthony Man-Cho So, Jiawei Zhang, Yinyu Ye
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.