Approximation of the supply scheduling problem (Q1779701): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the computational power of pushdown automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The concave cost supply problem. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? / rank | |||
Normal rank | |||
Latest revision as of 11:05, 10 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation of the supply scheduling problem |
scientific article |
Statements
Approximation of the supply scheduling problem (English)
0 references
1 June 2005
0 references
Combinatorial optimization
0 references
Approximation algorithm
0 references
Approximation scheme
0 references
