Numerical experiments with LP formulations of the maximum clique problem (Q2103941): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 457 / 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/s10100-021-00776-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3197317933 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Zero-One Linear Programming Reformulations for the Maximum Clique Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 457: finding all cliques of an undirected graph / 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: Edmonds polytopes and a hierarchy of combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-KP modeling for the maximum-clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test case generators and computational results for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2837833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5705147 / 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: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy algorithms for triangle free coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5395638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452109 / rank
 
Normal rank

Revision as of 01:43, 31 July 2024

scientific article
Language Label Description Also known as
English
Numerical experiments with LP formulations of the maximum clique problem
scientific article

    Statements

    Numerical experiments with LP formulations of the maximum clique problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 December 2022
    0 references
    combinatorial optimization
    0 references
    maximum clique problem
    0 references
    zero-one linear programming
    0 references
    greedy coloring
    0 references
    practical solutions of NP complete problems
    0 references
    LP relaxation bounds
    0 references

    Identifiers