SDP Relaxations for Some Combinatorial Optimization Problems (Q2802546): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent advances in the solution of quadratic assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new bound for the quadratic assignment problem based on convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving large quadratic assignment problems on computational grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lagrangian Relaxation of Quadratic Matrix Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph partitioning and parallel computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving quadratic assignment problems using convex quadratic programming relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Lift-and-Project Relaxations of Binary Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: QAPLIB - a quadratic assignment problem library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bandwidth problem for graphs and matrices—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic assignment problem. Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Semidefinite Programming Relaxations of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of lower bounds for the symmetric circulant traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On semidefinite programming relaxations of maximum \(k\)-section / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for the Partitioning of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hospital Layout as a Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of semidefinite programming. Theory, algorithms, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interlacing eigenvalues and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Assignments of Numbers to Vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A spectral approach to bandwidth and separator problems in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplace eigenvalues and bandwidth‐type invariants of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph partitioning using linear and semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Near-Maximum-Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix-Lifting Semi-Definite Programming for Detection in Multiple Antenna Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Sum of the Largest Eigenvalues of a Symmetric Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness of the bandwidth minimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copositive and semidefinite relaxations of the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Copositive Programming Approach to Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the quadratic assignment problem using the bundle method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projection technique for partitioning the nodes of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of the Delsarte and Lovász bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Backboard Wiring Problem: A Placement Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for the graph partitioning problem / rank
 
Normal rank

Latest revision as of 21:33, 11 July 2024

scientific article
Language Label Description Also known as
English
SDP Relaxations for Some Combinatorial Optimization Problems
scientific article

    Statements

    SDP Relaxations for Some Combinatorial Optimization Problems (English)
    0 references
    0 references
    26 April 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references