Enhancing Branch-and-Bound for Multiobjective 0-1 Programming

References

• Adelgren N, Gupte A (2022) Branch-and-bound for biobjective mixed-integer linear programming. INFORMS J. Comput. 34(2):909–933.Link, Google Scholar
• An D, Parragh SN, Sinnl M, Tricoire F (2024) A matheuristic for tri-objective binary integer programming. Comput. Oper. Res. 161:106397.Google Scholar
• Belotti P, Soylu B, Wiecek M (2016) Fathoming rules for biobjective mixed integer linear programs: Review and extensions. Discrete Optim. 22:341–363.Crossref, Google Scholar
• Benson HP (1998) An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem. J. Global Optim. 13:1–24.Crossref, Google Scholar
• Boland N, Savelsbergh HCM (2016) The l-shape search method for triobjective integer programming. Math. Programming Comput. 8(2):217–251.Crossref, Google Scholar
• Boland N, Charkhgard H, Savelsbergh M (2017) The quadrant shrinking method: A simple and efficient algorithm for solving tri-objective integer programs. Eur. J. Oper. Res. 260(3):873–885.Crossref, Google Scholar
• Dächert K, Fleuren T, Klamroth K (2021) A simple, efficient and versatile objective space algorithm for multiobjective integer programming. Working paper, HTW Dresden, Dresden, Germany.Google Scholar
• Ehrgott M (2005) Multicriteria Optimization, 2nd ed. (Springer, Berlin, Heidelberg).Google Scholar
• Ehrgott M, Gandibleux X (2007) Bound sets for biobjective combinatorial optimization problems. Comput. Oper. Res. 34(9):2674–2694.Crossref, Google Scholar
• Forget N, Gadegaard SL, Nielsen LR (2022a) Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs. Eur. J. Oper. Res. 302(3):909–924.Crossref, Google Scholar
• Forget N, Gadegaard SL, Klamroth K, Nielsen LR, Przybylski A (2022b) Branch-and-bound and objective branching with three or more objectives. Comput. Oper. Res. 148:106012.Crossref, Google Scholar
• Gadegaard S, Nielsen L, Ehrgott M (2019) Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets. INFORMS J. Comput. 31(4):790–804.Link, Google Scholar
• Gu Z, Nemhauser GL, Savelsbergh MW (1998) Lifted cover inequalities for 0-1 integer programs: Computation. INFORMS J. Comput. 10(4):427–437.Link, Google Scholar
• Hamel AH, Löhne A, Rudloff B (2013) Benson type algorithms for linear vector optimization and applications. J. Global Optim. 59(4):811–836.Crossref, Google Scholar
• Kirlik G (2014) Test instances for multiobjective discrete optimization problems. Accessed June 2021, http://home.ku.edu.tr/moolibrary/.Google Scholar
• Kirlik G, Sayın S (2014) A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems. Eur. J. Oper. Res. 232(3):479–488.Crossref, Google Scholar
• Kiziltan G, Yucaoğlu E (1983) An algorithm for multiobjective zero-one linear programming. Management Sci. 29(12):1444–1453.Link, Google Scholar
• Klamroth K, Lacour R, Vanderpooten D (2015) On the representation of the search region in multi-objective optimization. Eur. J. Oper. Res. 245(3):767–778.Crossref, Google Scholar
• Klein D, Hannan E (1982) An algorithm for the multiple objective integer linear programming problem. Eur. J. Oper. Res. 9(4):378–385.Crossref, Google Scholar
• Letchford AN, Souli G (2019) On lifted cover inequalities: A new lifting procedure with unusual properties. Oper. Res. Lett. 47(2):83–87.Crossref, Google Scholar
• Linderoth JT, Savelsbergh MW (1999) A computational study of search strategies for mixed integer programming. INFORMS J. Comput. 11(2):173–187.Link, Google Scholar
• Löhne A, Weißing B (2020) Bensolve - vlp solver, version 2.1.x. Accessed June 2021, http://www.bensolve.org.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
• Ozlen M, Burton B, MacRae C (2014) Multi-objective integer programming: An improved recursive algorithm. J. Optim. Theory Appl. 160(2):470–482.Crossref, Google Scholar
• Parragh S, Tricoire F (2019) Branch-and-bound for bi-objective integer programming. INFORMS J. Comput. 31(4):805–822.Link, Google Scholar
• Ramos RM, Alonso S, Sicilia J, González C (1998) The problem of the optimal biobjective spanning tree. Eur. J. Oper. Res. 111(3):617–628.Crossref, Google Scholar
• Santis MD, Eichfelder G, Niebling J, Rocktäschel S (2020) Solving multiobjective mixed integer convex optimization problems. SIAM J. Optim. 30(4):3122–3145.Crossref, Google Scholar
• Savelsbergh MW (1994) Preprocessing and probing techniques for mixed integer programming problems. ORSA J. Comput. 6(4):445–454.Link, Google Scholar
• Sourd F, Spanjaard O (2008) A multiobjective branch-and-bound framework: Application to the biobjective spanning tree problem. INFORMS J. Comput. 20(3):472–484.Link, Google Scholar
• Stidsen T, Andersen KA (2018) A hybrid approach for biobjective optimization. Discrete Optim. 28:89–114.Crossref, Google Scholar
• Stidsen T, Andersen KA, Dammann B (2014) A branch and bound algorithm for a class of biobjective mixed integer programs. Management Sci. 60(4):1009–1032.Link, Google Scholar
• Sylva J, Crema A (2004) A method for finding the set of non-dominated vectors for multiple objective integer linear programs. Eur. J. Oper. Res. 158(1):46–55.Crossref, Google Scholar
• Tamby S, Vanderpooten D (2021) Enumeration of the nondominated set of multiobjective discrete optimization problems. INFORMS J. Comput. 33(1):72–85.Link, Google Scholar
• Ulungu E, Teghem J (1995) The two phases method: An efficient procedure to solve bi-objective combinatorial optimization problems. Foundations Comput. Decision Sci. 20(2):149–165.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 the biobjective case. Comput. Oper. Res. 40(1):498–509.Crossref, Google Scholar
• Visée M, Teghem J, Pirlot M, Ulungu E (1995) The two-phases method: An efficient procedure to solve bi-objective combinatorial optimization problems. Foundations Comput. Decision Sci. 20:149–165.Google Scholar
• Visée M, Teghem J, Pirlot M, Ulungu EL (1998) Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem. J. Global Optim. 12(2):139–155.Crossref, Google Scholar