An extremal constrained routing problem with internal losses (Q1956632)
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: An extremal constrained routing problem with internal losses |
scientific article; zbMATH DE number 5790457
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An extremal constrained routing problem with internal losses |
scientific article; zbMATH DE number 5790457 |
Statements
An extremal constrained routing problem with internal losses (English)
0 references
23 September 2010
0 references
Traveling salesman problems (TSP) are considered, taking into account that a finite number of sets have to be visited and certain work has to be done at these sets. Performing this work, some related expenses arise. A dynamic programming procedure is then developed to find the global extremum of this TSP with internal costs.
0 references
traveling salesman problem
0 references
internal costs
0 references
dynamic programming
0 references
0 references
0 references
0 references
0 references
