Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations (Q2147168): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MiniZinc / rank | |||
Normal rank | |||
Revision as of 13:21, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations |
scientific article |
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
