Stronger \(K\)-tree relaxations for the vehicle routing problem (Q1827647)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2083620
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Stronger \(K\)-tree relaxations for the vehicle routing problem |
scientific article; zbMATH DE number 2083620 |
Statements
Stronger \(K\)-tree relaxations for the vehicle routing problem (English)
0 references
6 August 2004
0 references
Integer programming
0 references
Exact solution algorithm
0 references
Vehicle routing problem
0 references
Relax
0 references
and cut
0 references
0 references
0 references
0 references
0.8330971002578735
0 references
0.8330963253974915
0 references
0.828438401222229
0 references
0.8238088488578796
0 references
0.8178988695144653
0 references
