Author:
Boland Natashia,Charkhgard Hadi,Savelsbergh Martin
Publisher
Springer International Publishing
Reference8 articles.
1. Aneja, Y.P., Nair, K.P.K.: Bicriteria transportation problem. Management Science 27, 73–78 (1979)
2. Belotti, P., Soylu, B., Wiecek, M.M.: A branch-and-bound algorithm for biobjective mixed-integer programs,
http://www.optimization-online.org/DB_HTML/2013/01/3719.html
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. European Journal of Operational Research 139, 26–41 (2002)
4. Gardenghi, M., Gómez, T., Miguel, F., Wiecek, M.M.: Algebra of efficient sets for multiobjective complex systems. Journal of Optimization Theory and Applications 149, 385–410 (2011)
5. Isermann, H.: The enumeration of the set of all efficient solutions for a linear multiple objective program. Operational Research Quarterly 28(3), 711–725 (1977)
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献