Improving spectral bounds for clustering problems by Lagrangian relaxation
From MaRDI portal
Publication:4918244
DOI10.1111/j.1475-3995.2011.00825.xzbMath1270.90089OpenAlexW2127872150MaRDI QIDQ4918244
Andrea Lodi, Mohammad Dolatabadi, Zahra Afsharnejad
Publication date: 24 April 2013
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.2011.00825.x
Programming involving graphs or networks (90C35) Quadratic programming (90C20) Combinatorial optimization (90C27)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- The cut polytope and the Boolean quadric polytope
- Identification of network modules by optimization of ratio association
- ARPACK Users' Guide
- Detecting and Locating Near-Optimal Almost-Invariant Sets and Cycles
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- Deterministic Nonperiodic Flow
- On the cut polytope
- TRANSPORT IN DYNAMICAL ASTRONOMY AND MULTIBODY PROBLEMS
- Approximating K‐means‐type Clustering via Semidefinite Programming