Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets (Q3544249)
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: Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets |
scientific article; zbMATH DE number 5378733
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets |
scientific article; zbMATH DE number 5378733 |
Statements
Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets (English)
0 references
5 December 2008
0 references
inapproximability
0 references
approximation algorithms
0 references
subset travelling salesman
0 references
generalized bin packing
0 references
generalized scheduling problems
0 references
0.90572035
0 references
0.87655866
0 references
0 references
0.87071395
0 references
0.8695117
0 references
