k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach-Reference-Cited by-同舟云学术

k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach

Published:2009 Issue: Volume: Page:87-101
ISSN:0302-9743
Container-title:Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
language:
Short-container-title:

Author:

Gualandi Stefano

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-01929-6_8

Reference14 articles.

1. Monson, S., Pullman, N., Rees, R.: A survey of clique and biclique coverings and factorizations of (0,1)-matrices. Bull. of the Combin. and its Appl. 14, 17–86 (1992)

2. Faure, N., Chrétienne, P., Gourdin, E., Sourd, F.: Biclique completion problems for multicast network design. Discrete Optim. 4(3), 360–377 (2007)

3. Lecture Notes in Computer Science;T. Fahle,2002

4. Lecture Notes in Computer Science;J.C. Régin,2003

5. Barnier, N., Brisset, P.: Graph coloring for air traffic flow management. Ann. of Oper. Res. 130, 163–178 (2004)

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Population-Based Algorithm for the k-Clustering Minimum Biclique Completion Problem;2022 8th International Conference on Control, Decision and Information Technologies (CoDIT);2022-05-17

2. A rounding strategy-based algorithm for the k-clustering minimum biclique completion problem;Journal of the Operational Research Society;2022-02-21

3. Effect of Local Branching on the Iterative Rounding-Based Method: The Case of k-Clustering Minimum Completion Problems;Cybernetics and Systems;2021-12-02

4. An Iterative Randomized Rounding Algorithm for the k-Clustering Minimum Completion Problem with an Application in Telecommunication Field;Lecture Notes in Networks and Systems;2021-07-13

5. Constraint programming and operations research;Constraints;2017-12-29