1. Efficient storage of pareto points in biobjective mixed integer programming;Adelgren;CoRR,2014
2. Bicriteria transportation problem;Aneja;Management Science,1979
3. Belotti, P., Soylu, B., & Wiecek, M. M. (2013). A branch-and-bound algorithm for biobjective mixedinteger programs. Optimization Online.
4. Fathoming rules for biobjective mixed integer linear programs: Review and extensions;Belotti;Discrete Optimization,2016
5. Boland, N., Charkhgard, H., & Savelsbergh, M. (2013). Biobjective mixed integer programs instances. http://hdl.handle.net/1959.13/1036183.