Author:
Boland Natashia,Charkhgard Hadi,Savelsbergh Martin
Subject
Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering
Reference15 articles.
1. Bicriteria transportation problem;Aneja;Management Science,1979
2. Belotti, P., Soylu, B., & Wiecek, M. (2013). A branch-and-bound algorithm for biobjective mixed-integer programs. http://www.optimization-online.org/DB_FILE/2013/01/3719.pdf. (Accessed 01.03.16).
3. A criterion space search algorithm for biobjective integer programming: The balanced box method;Boland;INFORMS Journal on Computing,2015
4. The L-shape search method for triobjective integer programming;Boland;Math Programming Computation,2015
5. Lower bounds for the average and smoothed number of pareto-optima;Brunsch;Theory of Computing,2014
Cited by
46 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献