Fast Approximation Algorithms for Fractional Packing and Covering Problems (Q4848416): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:21, 8 February 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
