A unified matheuristic for solving multi-constrained traveling salesman problems with profits (Q1707083)
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 unified matheuristic for solving multi-constrained traveling salesman problems with profits |
scientific article; zbMATH DE number 6854271
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A unified matheuristic for solving multi-constrained traveling salesman problems with profits |
scientific article; zbMATH DE number 6854271 |
Statements
A unified matheuristic for solving multi-constrained traveling salesman problems with profits (English)
0 references
28 March 2018
0 references
profitable tour problem with compartments
0 references
matheuristic
0 references
exact loading neighborhoods
0 references
approximate routing neighborhoods
0 references
orienteering problem
0 references
orienteering problem with time window
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8963581
0 references
0.89603996
0 references
0.88923734
0 references
0.88202983
0 references
0.87622064
0 references
0.8749652
0 references
0.8685663
0 references
0.86645156
0 references
