Mixed integer programming formulations for the balanced traveling salesman problem with a lexicographic objective (Q5011674)
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 7387768
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Mixed integer programming formulations for the balanced traveling salesman problem with a lexicographic objective |
scientific article; zbMATH DE number 7387768 |
Statements
Mixed Integer Programming Formulations for the Balanced Traveling Salesman Problem with a Lexicographic Objective (English)
0 references
27 August 2021
0 references
balanced TSP
0 references
MIP
0 references
metaheuristics
0 references
0.7914831638336182
0 references
0.7410478591918945
0 references
0.734653890132904
0 references
0.7252107262611389
0 references
0.7248311042785645
0 references
