An exact algorithm for the maximum probabilistic clique problem (Q405671): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-013-9699-4 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-013-9699-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2120286774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity and decomposition of mean-risk stochastic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Clique in an Arbitrary Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements to MCS algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Robust Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-detection models in computational biochemistry and genomics / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Best Possible Heuristic for the <i>k</i>-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3372283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sample Approximation Approach for Optimization with Probabilistic Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5201292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Approximations of Chance Constrained Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sample average approximation method for chance constrained programming: Theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique Relaxation Models in Social Network Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4397004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding a maximum clique in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-and edge-deletion NP-complete problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10878-013-9699-4 / rank
 
Normal rank

Latest revision as of 16:35, 9 December 2024

scientific article
Language Label Description Also known as
English
An exact algorithm for the maximum probabilistic clique problem
scientific article

    Statements

    An exact algorithm for the maximum probabilistic clique problem (English)
    0 references
    0 references
    0 references
    5 September 2014
    0 references
    maximum clique problem
    0 references
    probabilistic programming
    0 references
    probabilistic clique
    0 references
    branch-and-bound
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers