An FPTAS for minimizing the product of two non-negative linear cost functions (Q623370): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4821526 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4747150 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation Schemes for the Restricted Shortest Path Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Quadratic programming and combinatorial minimum weight product problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: \(NP\)-hardness of linear multiplicative programming and related problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Quadratic programming with one negative eigenvalue is NP-hard / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation algorithms for indefinite quadratic programming / rank | |||
Normal rank | |||
Revision as of 18:08, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An FPTAS for minimizing the product of two non-negative linear cost functions |
scientific article |
Statements
An FPTAS for minimizing the product of two non-negative linear cost functions (English)
0 references
14 February 2011
0 references
quadratic programming
0 references
approximation schemes
0 references
combinatorial optimization
0 references
