Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems (Q274932)
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 6573066
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems |
scientific article; zbMATH DE number 6573066 |
Statements
Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems (English)
0 references
25 April 2016
0 references
multi-objective
0 references
traveling salesman problem
0 references
set covering problem
0 references
\(\varepsilon\)-constraint
0 references
exact Pareto set
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 references
0 references
0 references
0.8388478755950928
0 references
0.7776416540145874
0 references
0.7631072998046875
0 references
0.7477268576622009
0 references
