Detecting robust cliques in graphs subject to uncertain edge failures
From MaRDI portal
Publication:1640046
DOI10.1007/s10479-016-2161-0zbMath1390.90555OpenAlexW2299449272MaRDI QIDQ1640046
Vladimir L. Boginski, Oleksandra Yezerska, Sergiy I. Butenko
Publication date: 13 June 2018
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-016-2161-0
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
On risk-averse maximum weighted subgraph problems, Effective and efficient aggregation on uncertain graphs, Conditional value‐at‐risk beyond finance: a survey, Detecting large risk-averse 2-clubs in graphs with random edge failures
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An adaptive multistart tabu search approach to solve the maximum clique problem
- An exact algorithm for the maximum probabilistic clique problem
- On risk-averse maximum weighted subgraph problems
- An exact algorithm for the maximum clique problem
- A probabilistic heuristic for a computationally difficult set covering problem
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- A fast algorithm for the maximum clique problem
- Multi-neighborhood tabu search for the maximum weight clique problem
- Greedy randomized adaptive search procedures
- Future paths for integer programming and links to artificial intelligence
- Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
- Diversification strategies in tabu search algorithms for the maximum clique problem
- On clique relaxation models in network analysis
- Solving the maximum clique problem using a tabu search approach
- Clique-detection models in computational biochemistry and genomics
- A review on algorithms for maximum clique problems
- Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks
- Tabu Search—Part I
- Tabu Search—Part II
- A graph‐theoretic generalization of the clique concept
- Node-and edge-deletion NP-complete problems
- Assessing experimentally derived interactions in a small world
