An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits (Q953423): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:40, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits |
scientific article |
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
