Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster (Q342176): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2015.07.008 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2015.07.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1457372680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting high log-densities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Different Formulations for Solving the Heaviest<i>K</i>-Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Limited Memory Algorithm for Bound Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: CSDP, A C library for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering and domination in perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On weighted vs unweighted versions of combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discrete p-dispersion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Maximization Problems Arising in Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Lagrangian relaxation for general quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved semidefinite bounding procedure for solving max-cut problems to optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving \(k\)-cluster problems to optimality with semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds and exact algorithms for \(p\)-dispersion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Duality for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of semidefinite programming. Theory, algorithms, and applications / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2015.07.008 / rank
 
Normal rank

Latest revision as of 00:10, 9 December 2024

scientific article
Language Label Description Also known as
English
Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster
scientific article

    Statements

    Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster (English)
    0 references
    0 references
    0 references
    0 references
    17 November 2016
    0 references
    combinatorial optimization
    0 references
    semidefinite programming
    0 references
    triangle inequalities
    0 references
    \(k\)-cluster problem
    0 references
    \(k\)-densest subgraph problem
    0 references
    0 references
    0 references
    0 references

    Identifiers