An exact algorithm for the maximum probabilistic clique problem
From MaRDI portal
(Redirected from Publication:405671)
Recommendations
Cites work
- A Best Possible Heuristic for the k-Center Problem
- A fast algorithm for the maximum clique problem
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- A simple and faster branch-and-bound algorithm for finding a maximum clique
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
- An algorithm for finding a maximum clique in a graph
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- An exact algorithm for the maximum clique problem
- An integer programming and decomposition approach to general chance-constrained mathematical programs
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Clique relaxation models in social network analysis
- Clique-detection models in computational biochemistry and genomics
- Convex Approximations of Chance Constrained Programs
- Convexity and decomposition of mean-risk stochastic programs
- Finding a Maximum Clique in an Arbitrary Graph
- Graph Colorings
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1168330 (Why is no real title available?)
- Improvements to MCS algorithm for the maximum clique problem
- Lectures on Stochastic Programming
- Node-and edge-deletion NP-complete problems
- Numerical comparison of conditional value-at-risk and conditional drawdown-at-risk approaches: application to hedge funds
- Sample average approximation method for chance constrained programming: Theory and applications
- Scenario approximations of chance constraints
- The maximum clique problem
- Theory and applications of robust optimization
- Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
Cited in
(6)- Detecting robust cliques in graphs subject to uncertain edge failures
- Exact algorithms for maximum clique: a computational study
- New restrictions on defective coloring with applications to Steinberg-type graphs
- On risk-averse maximum weighted subgraph problems
- hClique: An exact algorithm for maximum clique problem in uniform hypergraphs
- A survey on optimization studies of group centrality metrics
This page was built for publication: An exact algorithm for the maximum probabilistic clique problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405671)
