Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm (Q4994165): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: New path elimination constraints for multi-depot routing problems / rank | |||
Normal rank | |||
Revision as of 12:50, 4 December 2024
scientific article; zbMATH DE number 7360285
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm |
scientific article; zbMATH DE number 7360285 |
Statements
Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm (English)
0 references
17 June 2021
0 references
branch-and-cut
0 references
valid inequalities
0 references
asymmetric
0 references
multidepot
0 references
vehicle routing
0 references
upper-bound procedure
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
