Name
Title | ||
|---|---|---|
Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits. |
Abstract | ||
|---|---|---|
We describe two approximation schemes for bi-objective combinatorial optimization problems with nonnegative, integer valued objectives. The procedures compute a subset of the efficient points such that any other efficient point is within an arbitrary factor from a computed one with respect to both objectives. Both schemes are simple modifications of classical algorithms for the construction of the whole efficient set. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.cor.2013.02.011 | Computers & Operations Research |
Keywords | DocType | Volume |
Multi-objective combinatorial optimization,Complexity,Approximation,TSP with profits | Journal | 40 |
Issue | ISSN | Citations |
10 | 0305-0548 | 8 |
PageRank | References | Authors |
0.51 | 18 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Carlo Filippi | 1 | 168 | 13.77 |
| Elisa Stevanato | 2 | 16 | 1.73 |