Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff (Q6667800)
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: Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff |
scientific article; zbMATH DE number 7971813
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff |
scientific article; zbMATH DE number 7971813 |
Statements
Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff (English)
0 references
21 January 2025
0 references
branch-price-and-cut
0 references
partial dominance
0 references
column generation
0 references
labeling algorithm
0 references
vehicle routing and scheduling
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
