Mixed integer programming formulations for the generalized traveling salesman problem with time windows (Q6057720)
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 7755406
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Mixed integer programming formulations for the generalized traveling salesman problem with time windows |
scientific article; zbMATH DE number 7755406 |
Statements
Mixed integer programming formulations for the generalized traveling salesman problem with time windows (English)
0 references
26 October 2023
0 references
generalized traveling salesman problem
0 references
time windows
0 references
mixed integer programming formulations
0 references
last mile delivery
0 references
0 references
0 references
0.93113667
0 references
0.9099047
0 references
0.9077462
0 references
0.9039521
0 references
0.89414036
0 references
0.89135647
0 references
0.8900562
0 references
0.8852031
0 references
0.88345563
0 references
