- Title
- A criterion space search algorithm for biobjective mixed integer programming: the triangle splitting method
- Creator
- Boland, Natashia; Charkhgard, Hadi; Savelsbergh, Martin
- Relation
- INFORMS Journal on Computing Vol. 27, Issue 4, p. 597-618
- Publisher Link
- http://dx.doi.org/10.1287/ijoc.2015.0646
- Publisher
- Institute for Operations Research and the Management Sciences (INFORMS)
- Resource Type
- journal article
- Date
- 2015
- Description
- 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.
- Subject
- biobjective mixed integer programming; criterion space search algorithm; the triangle splitting method
- Identifier
- http://hdl.handle.net/1959.13/1317346
- Identifier
- uon:23395
- Identifier
- ISSN:1091-9856
- Language
- eng
- Reviewed
- Hits: 946
- Visitors: 937
- Downloads: 0
Thumbnail | File | Description | Size | Format |
---|