An Adaptive Neighborhood Search for k-Clustering Minimum Bi-clique Completion Problems

DOI10.1007/978-3-319-18161-5_2zbMath1370.90218OpenAlexW1146855678MaRDI QIDQ5356965

Toufik Saadi, Sagvan Saleh, Ibrahim Moussa, Mhand Hifi

Publication date: 12 September 2017

Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18161-5_2

zbMATH Keywords

combinatorial optimizationlocal searchheuristicbi-clique

Mathematics Subject Classification ID

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

Cites Work

• Approximation algorithms for combinatorial problems
• Biclique completion problems for multicast network design
• A reactive local search-based algorithm for the disjunctively constrained knapsack problem
• k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach
• A branch‐and‐price approach to k‐clustering minimum biclique completion problem
• Unnamed Item

This page was built for publication: An Adaptive Neighborhood Search for k-Clustering Minimum Bi-clique Completion Problems