Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (Q653316)
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: Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem |
scientific article; zbMATH DE number 5995819
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem |
scientific article; zbMATH DE number 5995819 |
Statements
Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (English)
0 references
9 January 2012
0 references
0 references
0 references
0 references
0 references
0.7488818168640137
0 references
0.7289360165596008
0 references
0.726898193359375
0 references
0.7263570427894592
0 references
0.7224672436714172
0 references
