k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach
From MaRDI portal
Publication:3630154
DOI10.1007/978-3-642-01929-6_8zbMath1241.68101OpenAlexW1589307603MaRDI QIDQ3630154
Publication date: 3 June 2009
Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-01929-6_8
Programming involving graphs or networks (90C35) Semidefinite programming (90C22) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (4)
Constraint programming and operations research ⋮ An Adaptive Neighborhood Search for k-Clustering Minimum Bi-clique Completion Problems ⋮ A branch‐and‐price approach to k‐clustering minimum biclique completion problem ⋮ Semidefinite Programming and Constraint Programming
Uses Software
This page was built for publication: k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach
