Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations (Q2147168)
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-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations |
scientific article; zbMATH DE number 7546585
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations |
scientific article; zbMATH DE number 7546585 |
Statements
Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations (English)
0 references
22 June 2022
0 references
vehicle routing problem
0 references
synchronization
0 references
scheduling
0 references
Dantzig-Wolfe decomposition
0 references
logic-based Benders decomposition
0 references
conflict-driven clause learning
0 references
0 references
0 references
0.9184764
0 references
0.9179833
0 references
0.9150917
0 references
0.90526885
0 references
0.9006494
0 references
0.89731216
0 references
0.89674836
0 references
0.8951937
0 references
0.8948653
0 references
