New LP relaxations for minimum cycle/path/tree cover problems (Q2283007)
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: New LP relaxations for minimum cycle/path/tree cover problems |
scientific article; zbMATH DE number 7146676
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New LP relaxations for minimum cycle/path/tree cover problems |
scientific article; zbMATH DE number 7146676 |
Statements
New LP relaxations for minimum cycle/path/tree cover problems (English)
0 references
27 December 2019
0 references
vehicle routing
0 references
cycle cover
0 references
path cover
0 references
approximation algorithm
0 references
integrality gap
0 references
0 references
0 references
0 references
0.9956913590431212
0 references
0.816947340965271
0 references
0.7966458201408386
0 references
0.7862623929977417
0 references
0.7834798693656921
0 references
