An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem (Q2255969): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2013.08.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965683593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph‐theoretic definition of a sociometric clique† / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the maximum edge weight clique problem via unconstrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer models and upper bounds for the 3‐club problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projection, lifting and extended formulation integer and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Novel approaches for analyzing biological networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected combinatorial problems of computational biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs as models of communication network vulnerability: Connectivity and persistence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mining market data: a network approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum \(k\)-club problem in an undirected graph / 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: Upper bounds and heuristics for the 2-club problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A classification of formulations for the (time-dependent) traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended and discretized formulations for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative analysis of several asymmetric traveling salesman problem formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: New facets and a branch-and-cut algorithm for the weighted clique problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems / rank
 
Normal rank

Latest revision as of 16:41, 9 July 2024

scientific article
Language Label Description Also known as
English
An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem
scientific article

    Statements

    An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem (English)
    0 references
    0 references
    0 references
    18 February 2015
    0 references
    combinatorial optimization
    0 references
    formulations
    0 references
    \(k\)-clubs
    0 references
    integer programming
    0 references
    clique relaxations
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references