We present a fast and robust algorithm for solving biobjective mixed integer programs. The algorithm extends and merges ideas from two existing methods: the Boxed Line Method and the epsilon-Tabu Method. We demonstrate its efficacy in an extensive computational study. We also demonstrate that it is capable of producing a high-quality approximation of the nondominated frontier in a fraction of the time required to produce the complete nondominated frontier.
Citation
unpublished
Article
View A Fast and Robust Algorithm for Solving Biobjective Mixed Integer Programs