A branch‐and‐price approach to k‐clustering minimum biclique completion problem

DOI10.1111/j.1475-3995.2012.00860.xzbMath1263.90114OpenAlexW1977415390MaRDI QIDQ4921257

Claudio Magni, Francesco Maffioli, Stefano Gualandi

Publication date: 23 May 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.2012.00860.x

zbMATH Keywords

clusteringlocal searchbranch and pricebiclique

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (2)

An Adaptive Neighborhood Search for k-Clustering Minimum Bi-clique Completion Problems ⋮ On star and biclique edge-colorings

Uses Software

• COMET
• DSDP5

Cites Work

• A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
• Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
• Control abstractions for local search
• Contraint-based combinators for local search
• Biclique completion problems for multicast network design
• On the asymmetric representatives formulation for the vertex coloring problem
• Algorithm 875
• k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Variable neighborhood search: Principles and applications

This page was built for publication: A branch‐and‐price approach to k‐clustering minimum biclique completion problem