An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits (Q953423)
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 exact -constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits |
scientific article; zbMATH DE number 5370055
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits |
scientific article; zbMATH DE number 5370055 |
Statements
An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits (English)
0 references
20 November 2008
0 references
bi-objective combinatorial optimization
0 references
\(\epsilon\)-constraint problem
0 references
Pareto front
0 references
branch-and-cut
0 references
traveling salesman problem with profits
0 references
0 references
0 references
0.8274614810943604
0 references
0.8008745908737183
0 references
0.7951744794845581
0 references
0.7813680768013
0 references
