A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method

References

• Aneja YP, Nair KPK (1979) Bicriteria transportation problem. Management Sci. 25(1):73–78.Link, Google Scholar
• Belotti P, Soylu B, Wiecek MM (2013) A branch-and-bound algorithm for biobjective mixed-integer programs. Accessed January 1, 2015, http://www.optimization-online.org/DB_FILE/2013/01/3719.pdf.Google Scholar
• Boland N, Charkhgard H, Savelsbergh M (2015) A criterion space search algorithm for biobjective integer programming: The balanced box method. INFORMS J. Comput. Forthcoming.Google Scholar
• Gardenghi M, Gómez T, Miguel F, Wiecek MM (2011) Algebra of efficient sets for multiobjective complex systems. J. Optim. Theory Appl. 149(2):385–410.Crossref, Google Scholar
• Isermann H (1977) The enumeration of the set of all efficient solutions for a linear multiple objective program. Oper. Res. Quart. 28(3):711–725.Crossref, Google Scholar
• Mavrotas G, Diakoulaki D (1998) A branch and bound algorithm for mixed zero-one multiple objective linear programming. Eur. J. Oper. Res. 107(3):530–541.Crossref, Google Scholar
• Mavrotas G, Diakoulaki D (2005) Multi-criteria branch and bound: A vector maximization algorithm for mixed 0–1 multiple objective linear programming. Appl. Math. Comput. 171(1): 53–71.Crossref, Google Scholar
• Vincent T, Seipp F, Ruzika S, Przybylski A, Gandibleux X (2013) Multiple objective branch and bound for mixed 0–1 linear programming: Corrections and improvements for biobjective case. Comput. Oper. Res. 40(1):498–509.Crossref, Google Scholar
• Zitzler E, Thiele L, Laumanns M, Fonseca CM, Da Fonseca VG (2003) Performance assessment of multiobjective optimizers: An analysis and review. IEEE Trans. Evolutionary Comput. 7(2):117–132.Crossref, Google Scholar