A General Regularized Continuous Formulation for the Maximum Clique Problem (Q5108235): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q128196211, #quickstatements; #temporary_batch_1722805341585
 
(6 intermediate revisions by 6 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963121468 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1709.02486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3151174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolution towards the maximum clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copositivity for second-order optimality conditions in general smooth optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Annealed replication: A new heuristic for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parsimonious least norm approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous Characterizations of the Maximum Clique Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions for maximizing a function over a polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On solving the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxima for Graphs and a New Proof of a Theorem of Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some NP-complete problems in quadratic and nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization approach for solving the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking local optimality in constrained quadratic programming is NP- hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of the Motzkin-Straus theorem to hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review on algorithms for maximum clique problems / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128196211 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:08, 4 August 2024

scientific article; zbMATH DE number 7195292
Language Label Description Also known as
English
A General Regularized Continuous Formulation for the Maximum Clique Problem
scientific article; zbMATH DE number 7195292

    Statements

    A General Regularized Continuous Formulation for the Maximum Clique Problem (English)
    0 references
    0 references
    0 references
    30 April 2020
    0 references
    maximum clique
    0 references
    sparse optimization
    0 references
    support
    0 references
    concave minimization
    0 references
    Motzkin-Straus
    0 references

    Identifiers

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