Branch-and-Bound for Bi-objective Integer Programming

References

• Adelgren N, Belotti P, Gupte A (2018) Efficient storage of Pareto points in biobjective mixed integer programming. INFORMS J. Comput. 30(2):217–420.Google Scholar
• Adelgren N, Gupte A (2016) Branch-and-bound for biobjective mixed integer programming. https://arxiv.org/abs/1709.03668.Google Scholar
• Aneja YP, Nair KPK (1979) Bicriteria transportation problem. Management Sci. 25(1):73–78.Link, Google Scholar
• Baldacci R, Mingozzi A, Roberti R (2012) Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. Eur. J. Oper. Res. 218(1):1–6.Crossref, Google Scholar
• Belotti P, Soylu B, Wiecek MM (2013) A branch-and-bound algorithm for biobjective mixed-integer programs. Accessed December 26, 2018, http://www.optimization-online.org/DB_HTML/2013/01/3719.html.Google Scholar
• Belotti P, Soylu B, Wiecek MM (2016) Fathoming rules for biobjective mixed integer linear programs: Review and extensions. Discrete Optim. 22(B):341–363.Crossref, Google Scholar
• Boland N, Charkhgard H, Savelsbergh M (2015a) A criterion space search algorithm for biobjective integer programming: The balanced box method. INFORMS J. Comput. 27(4):735–754.Link, Google Scholar
• Boland N, Charkhgard H, Savelsbergh M (2015b) A criterion space search algorithm for biobjective mixed integer programming: The triangle splitting method. INFORMS J. Comput. 27(4):597–618.Link, Google Scholar
• Braekers K, Hartl RF, Parragh SN, Tricoire F (2016) A bi-objective home care scheduling problem: Analyzing the trade-off between costs and client inconvenience. Eur. J. Oper. Res. 248(2):428–443.Crossref, Google Scholar
• Desrosiers J, Lübbecke ME (2005) A primer in column generation. Desaulniers G, Desrosiers J, Solomon MM, eds. Column Generation (Springer, New York), 1–32.Crossref, Google Scholar
• Dolan ED, Moré JJ (2002) Benchmarking optimization software with performance profiles. Math. Programming 91(2):201–213.Crossref, Google Scholar
• Ehrgott M (2005) Multicriteria Optimization, vol. 2 (Springer, New York).Google Scholar
• Ehrgott M, Gandibleux X (2006) Bound sets for biobjective combinatorial optimization problems. Comput. Oper. Res. 34(9):2674–2694.Crossref, Google Scholar
• Feillet D, Dejax P, Gendreau M, Gueguen C (2004) An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks 44(3):216–229.Crossref, Google Scholar
• Gadegaard S, Ehrgott M, Nielsen L (2016a) Bi-objective branch-and-cut algorithms: Applications to the single source capacitated facility location problem. Working paper, Aarhus University, Aarhus, Denmark.Google Scholar
• Gadegaard S, Nielsen L, Ehrgott M (2016b) An instance generator for the capacitated facility location problem. Github, source code (v1.0.0). Accessed December 26, 2018, https://github.com/SuneGadegaard/SSCFLPgenerator.Google Scholar
• Haimes Y, Lasdon L, Wismer D (1971) On a bicriterion formulation of the problems of integrated system identification and system optimization. IEEE Trans. Syst., Man Cybernetics 1(3):296–297.Crossref, Google Scholar
• Jozefowiez N, Laporte G, Semet F (2012) A generic branch-and-cut algorithm for multiobjective optimization problems: Application to the multilabel traveling salesman problem. INFORMS J. Comput. 24(4):554–564.Link, Google Scholar
• Leitner M, Ljubić I, Sinnl M (2014) A computational study of exact approaches for the bi-objective prize-collecting steiner tree problem. INFORMS J. Comput. 27(1):118–134.Link, Google Scholar
• Masin M, Bukchin Y (2008) Diversity maximization approach for multiobjective optimization. Oper. Res. 56(2):411–424.Link, 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
• Raith A, Moradi S, Ehrgott M, Stiglmayr M (2012) Exploring bi-objective column generation. Proc. 46th Annual ORSNZ Conf., Victoria University, Wellington, 288–296.Google Scholar
• Ramos TRP, Gomes MI, Barbosa-Póvoa AP (2014) Planning a sustainable reverse logistics system: Balancing costs with environmental and social concerns. Omega 48:60–74.Crossref, Google Scholar
• Righini G, Salani M (2009) Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming. Comput. Oper. Res. 36(4):1191–1203.Crossref, Google Scholar
• Sarpong BM, Artigues C, Jozefowiez N (2013) Column generation for bi-objective vehicle routing problems with a min-max objective. 13th Workshop Algorithmic Approaches Transportation Modelling Optimization Systems, ATMOS 2013 (INRIA, Sophia Antipolis, France), 137–149.Google Scholar
• Sourd F, Spanjaard O (2008) A multi-objective 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, 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
• Tam B, Ehrgott M, Ryan D, Zakeri G (2011) A comparison of stochastic programming and bi-objective optimisation approaches to robust airline crew scheduling. OR Spectrum 33(1):49–75.Crossref, Google Scholar
• Tricoire F, Graf A, Gutjahr WJ (2012) The bi-objective stochastic covering tour problem. Comput. Oper. Res. 39(7):1582–1592.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 the biobjective case. Comput. Oper. Res. 40(1):498–509.Crossref, 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