A new formulation for the traveling deliveryman problem (Q1003469)
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: A new formulation for the traveling deliveryman problem |
scientific article; zbMATH DE number 5522964
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new formulation for the traveling deliveryman problem |
scientific article; zbMATH DE number 5522964 |
Statements
A new formulation for the traveling deliveryman problem (English)
0 references
4 March 2009
0 references
traveling deliveryman problem
0 references
integer programming
0 references
branch-and-cut algorithms
0 references
0 references
0 references
0.8134790658950806
0 references
0.8104087710380554
0 references
0.7945050001144409
0 references
0.7810845971107483
0 references
