New path elimination constraints for multi-depot routing problems (Q6496355)
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 7841990
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New path elimination constraints for multi-depot routing problems |
scientific article; zbMATH DE number 7841990 |
Statements
New path elimination constraints for multi-depot routing problems (English)
0 references
3 May 2024
0 references
multi-depot routing
0 references
branch-and-cut
0 references
separation
0 references
traveling salesman
0 references
integer linear programming
0 references
reformulation
0 references
0 references
0.8425713181495667
0 references
0.7985764741897583
0 references
0.7856857180595398
0 references
0.784909188747406
0 references
0.7786851525306702
0 references
