Author:
Boland Natashia,Charkhgard Hadi,Savelsbergh Martin
Publisher
Springer Science and Business Media LLC
Subject
Software,Theoretical Computer Science
Reference40 articles.
1. Aneja, Y.P., Nair, K.P.K.: Bicriteria transportation problem. Manag Sci 27, 73–78 (1979)
2. Belotti, P., Soylu, B., Wiecek, M.: A branch-and-bound algorithm for biobjective mixed-integer programs (2013). http://www.optimization-online.org/DB_FILE/2013/01/3719.pdf
3. Benson, H.P., Sun, E.: A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of multiple objective linear program. Eur. J. Oper. Res. 139, 26–41 (2002)
4. Beume, N., Fonseca, C., Lopez-Ibanez, M., Paquete, L., Vahrenhold, J.: On the complexity of computing the hypervolume indicator. IEEE Trans. Evol. Comput. 13, 1075–1082 (2009)
5. Boland, N., Charkhgard, H., Savelsbergh, M.: A criterion space search algorithm for biobjective integer programming: the balanced-box method. INFORMS J. Comput. (to appear)
Cited by
42 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献