The L-shape search method for triobjective integer programming
- We present a new criterion space search method, the L-shape search method, for finding all nondominated points of a triobjective integer program. The method is easy to implement, and is more efficient than existing methods. Moreover, it is intrinsically well-suited for producing high quality approximate nondominated frontiers early in the search process. An extensive computational study demonstrates its efficacy.
| Author: | Natashia Boland, Hadi Charkhgard, Martin Savelsbergh |
|---|---|
| DOI: | https://doi.org/10.1007/s12532-015-0093-3 |
| ISSN: | 1867-2949 |
| Parent Title (English): | Mathematical Programming Computation |
| Publisher: | Springer Science and Business Media LLC |
| Document Type: | Article |
| Language: | English |
| Year of Completion: | 2015 |
| Tag: | Software; Theoretical Computer Science |
| Volume: | 8 |
| Issue: | 2 |
| Page Number: | 35 |
| First Page: | 217 |
| Last Page: | 251 |
| Mathematical Programming Computation : | MPC 2016 - Issue 2 |

