Fast Approximation Algorithms for Fractional Packing and Covering Problems (Q4848416): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/moor.20.2.257 / rank | |||
| Property / author | |||
| Property / author: Serge A. Plotkin / rank | |||
| Property / author | |||
| Property / author: Serge A. Plotkin / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2134422938 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/MOOR.20.2.257 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 15:16, 30 December 2024
scientific article; zbMATH DE number 797196
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast Approximation Algorithms for Fractional Packing and Covering Problems |
scientific article; zbMATH DE number 797196 |
Statements
Fast Approximation Algorithms for Fractional Packing and Covering Problems (English)
0 references
17 September 1995
0 references
approximate solutions
0 references
fractional packing
0 references
covering
0 references
multicommodity flow
0 references
Lagrangian relaxation
0 references
unrelated parallel machines
0 references
job shop problem
0 references
traveling salesman
0 references
cutting-stock
0 references
network embedding
0 references
minimum-cost multicommodity flow
0 references
