Name
Abstract | ||
|---|---|---|
A parametric algorithm for identifying the Pareto set of a biobjective integer program is proposed. The algorithm is based on the weighted Chebyshev (Tchebyche) scalarization, and its running time is asymptotically optimal. A number of extensions are described, including: a technique for handling weakly dominated outcomes, a Pareto set approximation scheme, and an interactive version that provides access to all Pareto outcomes. Extensive computational tests on instances of the biobjective knapsack problem and a capacitated network routing problem are presented. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/s10479-006-0058-z | Annals OR |
Keywords | Field | DocType |
Knapsack Problem,Ideal Point,Level Line,Pareto Point,Feasible Outcome | Integer,Discrete mathematics,Mathematical optimization,Network routing,Algorithm,Set approximation,Parametric statistics,Chebyshev filter,Knapsack problem,Asymptotically optimal algorithm,Mathematics,Pareto principle | Journal |
Volume | Issue | ISSN |
147 | 1 | 0254-5330 |
Citations | PageRank | References |
27 | 1.32 | 15 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ted K. Ralphs | 1 | 219 | 15.18 |
| Matthew J. Saltzman | 2 | 237 | 27.77 |
| Margaret M. Wiecek | 3 | 213 | 22.90 |