Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming (Q3439163): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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
29 May 2007
0 references
0 references
