Fast Approximation Algorithms for Fractional Packing and Covering Problems (Q4848416)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast Approximation Algorithms for Fractional Packing and Covering Problems |
scientific article; zbMATH DE number 797196
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8890998363494873
0 references
0.8457731604576111
0 references
0.828803300857544
0 references
0.8287371397018433
0 references
