Branch-price-and-cut for the mixed capacitated general routing problem with time windows (Q1754228)
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: Branch-price-and-cut for the mixed capacitated general routing problem with time windows |
scientific article; zbMATH DE number 6876637
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branch-price-and-cut for the mixed capacitated general routing problem with time windows |
scientific article; zbMATH DE number 6876637 |
Statements
Branch-price-and-cut for the mixed capacitated general routing problem with time windows (English)
0 references
30 May 2018
0 references
general routing problem
0 references
graph transformation
0 references
integer programming
0 references
column generation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.92043173
0 references
0.91717124
0 references
0.91263735
0 references
0.90630096
0 references
0.9061217
0 references
0 references
0.9022258
0 references
0.9015205
0 references
