A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand (Q2208355)
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 7268948
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand |
scientific article; zbMATH DE number 7268948 |
Statements
A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand (English)
0 references
2 November 2020
0 references
vehicle routing
0 references
multiple vehicle traveling purchaser problem
0 references
unitary demand
0 references
incompatible products
0 references
column generation
0 references
dynamic-programming labeling algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8643499612808228
0 references
0.8632556796073914
0 references
0.8189834356307983
0 references
0.7946634292602539
0 references
0.7897801995277405
0 references
