A variable neighborhood search heuristic for the maximum ratio clique problem (Q1652431): Difference between revisions

From MaRDI portal
Added link to MaRDI 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.1016/j.cor.2017.01.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2582069059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945528 / 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: Algorithm 457: finding all cliques of an undirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general VNS heuristic for the traveling salesman problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a continuous approach for the maximum weighted clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric approaches to fractional programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5734003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Novel Efficient Approach for Solving the Art Gallery Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long-short portfolio optimization under cardinality constraints by difference of convex functions algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Start Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complementary Pivoting Approach to the Maximum Weight Clique Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighbourhood search for bandwidth reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Ratio Clique Problem: A Continuous Optimization Approach and Some New Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum ratio clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer programming approach for finding the most and the least central cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review on algorithms for maximum clique problems / rank
 
Normal rank

Latest revision as of 03:13, 16 July 2024

scientific article
Language Label Description Also known as
English
A variable neighborhood search heuristic for the maximum ratio clique problem
scientific article

    Statements

    A variable neighborhood search heuristic for the maximum ratio clique problem (English)
    0 references
    0 references
    0 references
    0 references
    11 July 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    variable neighborhood search
    0 references
    heuristic
    0 references
    metaheuristic
    0 references
    maximum ratio clique problem
    0 references
    maximal clique
    0 references
    0 references