Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
Year of publication: |
2013
|
---|---|
Authors: | Trukhanov, Svyatoslav ; Balasubramaniam, Chitra ; Balasundaram, Balabhaskar ; Butenko, Sergiy |
Published in: |
Computational Optimization and Applications. - Springer. - Vol. 56.2013, 1, p. 113-130
|
Publisher: |
Springer |
Subject: | Russian Doll Search | Clique relaxations | s-plex | s-defective clique |
-
Exact solution algorithms for the maximum flow problem with additional conflict constraints
Şuvak, Zeynep, (2020)
-
Frequency-driven tabu search for the maximum s-plex problem
Zhou, Yi, (2017)
-
An analytical comparison of the LP relaxations of integer models for the k-club problem
Almeida, Maria Teresa, (2014)
- More ...
-
Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
Balasundaram, Balabhaskar, (2010)
-
On robust clusters of minimum cardinality in networks
Balasubramaniam, Chitra, (2017)
-
A network-based data mining approach to portfolio selection via weighted clique relaxations
Boginski, Vladimir, (2014)
- More ...