Stronger \(K\)-tree relaxations for the vehicle routing problem (Q1827647): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: VRP / rank | |||
Normal rank | |||
Revision as of 01:54, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stronger \(K\)-tree relaxations for the vehicle routing problem |
scientific article |
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
