The maximum ratio clique problem (Q2356159): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Approximation algorithms for fractional knapsack problems / 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: Minimal ratio spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5583694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Nonlinear Fractional Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of a class of nonlinear knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: A characterization of the minimum cycle mean in a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization with Rational Objective Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: New scaling algorithms for the assignment and minimum mean cycle problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5462193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On complexity of unconstrained hyperbolic 0--1 programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247441 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for well‐covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for fractional assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of minimum ratio spanning tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of 0-1 hyperbolic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization algorithm for solving the minimum multiple ratio spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a global approach for general 0-1 fractional programming / rank
 
Normal rank

Latest revision as of 13:39, 10 July 2024

scientific article
Language Label Description Also known as
English
The maximum ratio clique problem
scientific article

    Statements

    The maximum ratio clique problem (English)
    0 references
    0 references
    0 references
    29 July 2015
    0 references
    maximum clique
    0 references
    fractional combinatorial optimization
    0 references
    social network analysis
    0 references
    market graph
    0 references

    Identifiers

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