Name
Title | ||
|---|---|---|
A Criterion Space Search Algorithm For Biobjective Mixed Integer Programming: The Triangle Splitting Method |
Abstract | ||
|---|---|---|
We present the first criterion space search algorithm, the triangle splitting method, for finding all nondominated points of a biobjective mixed integer program. The algorithm is relatively easy to implement and converges quickly to the complete set of nondominated points. The algorithm maintains, at any point in time, a diverse set of nondominated points, and is thus ideally suited for fast approximation of the nondominated frontier. An extensive computational study demonstrates the efficacy of the triangle splitting method. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1287/ijoc.2015.0646 | INFORMS JOURNAL ON COMPUTING |
Keywords | Field | DocType |
biobjective mixed integer programming, criterion space search algorithm, the triangle splitting method | Integer,Discrete mathematics,Mathematical optimization,Search algorithm,Integer programming,Mathematics | Journal |
Volume | Issue | ISSN |
27 | 4 | 1091-9856 |
Citations | PageRank | References |
7 | 0.49 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Natashia Boland | 1 | 726 | 67.11 |
| Hadi Charkhgard | 2 | 46 | 9.07 |
| Martin Savelsbergh | 3 | 2624 | 190.83 |