Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169)
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: Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints |
scientific article; zbMATH DE number 6405950
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints |
scientific article; zbMATH DE number 6405950 |
Statements
Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (English)
0 references
19 February 2015
0 references
branch-and-price
0 references
branch-and-price-and-cut
0 references
traveling repairmen problem
0 references
distance constraint
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8434228301048279
0 references
0.783970832824707
0 references
0.7807058095932007
0 references
0.7748914957046509
0 references
0.7693294882774353
0 references
