Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming (Q3439163): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.endm.2004.03.054 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2090409762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding independent sets in a graph using continuous multivariable polynomial formulations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On standard quadratic optimization problems / 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: Maxima for Graphs and a New Proof of a Theorem of Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5670441 / rank
 
Normal rank

Latest revision as of 19:06, 25 June 2024

scientific article
Language Label Description Also known as
English
Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming
scientific article

    Statements

    Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming (English)
    0 references
    0 references
    29 May 2007
    0 references

    Identifiers