Multi-objective branch and bound
Tóm tắt
Từ khóa
Tài liệu tham khảo
Bazgan, 2009, Solving efficiently the 0–1 multi-objective knapsack problem, Computers & Operations Research, 36, 260, 10.1016/j.cor.2007.09.009
Belotti, P. (2014). Personal communication.
Belotti, 2013, A branch-and-bound algorithm for biobjective mixed-integer programs
Boland, 2015, A criterion space search algorithm for biobjective mixed integer programming: The triangle search method, INFORMS Journal on Computing, 27, 597, 10.1287/ijoc.2015.0646
Bouibede-Hocine, 2007
Cacchiani, 2013, A branch-and-bound algorithm for convex multi-objective mixed integer non-linear programming problems
Cerqueus, 2015, A branch-and-cut method for the bi-objective bi-dimensional knapsack problem
Cerqueus, 2015, Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems, European Journal of Operational Research, 244, 417, 10.1016/j.ejor.2015.01.035
Cohon, 1978
Deb, 2001
Dellnitz, 2005, Covering pareto sets by multilevel subdivision techniques, Journal of Optimization Theory and Applications, 124, 113, 10.1007/s10957-004-6468-7
Delort, 2011
Delort, 2010, Using bound sets in multiobjective optimization: Application to the biobjective binary knapsack problem, Vol. 6049, 253
Ehrgott, 2005
Ehrgott, 2000, A survey and annotated bibliography of multiobjective combinatorial optimization, OR Spektrum, 22, 425, 10.1007/s002910000046
Ehrgott, 2001, Bounds and bound sets for biobjective combinatorial optimization problems, Vol. 507, 241
Ehrgott, 2007, Bound sets for biobjective combinatorial optimization problems, Computers & Operations Research, 34, 2674, 10.1016/j.cor.2005.10.003
Ehrgott, 2003, Computation of ideal and nadir values and implications for their use in MCDM methods, European Journal of Operational Research, 151, 119, 10.1016/S0377-2217(02)00595-7
Fernández, 2007, Obtaining an outer approximation of the efficient set of nonlinear biobjective problems, Journal of Global Optimization, 38, 315, 10.1007/s10898-006-9132-y
Fernández, 2009, Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods, Computational Optimization and Applications, 42, 393, 10.1007/s10589-007-9135-8
Florios, 2010, Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms, European Journal of Operational Research, 203, 14, 10.1016/j.ejor.2009.06.024
Freuder, 2005, Constraint programming, 239
Gadegaard, 2015, A cut and branch approach for a class of bi-objective combinatorial optimization problems
Gandibleux, X., Przybylski, A., Bourougaa, S., Derrien, A., & Grimault, A. (2012). Computing the efficient frontier for the 0/1 biobjective uncapacitated facility location problem. cors/mopgp’12, june 11–13, niagara falls (canada).
Gendron, 1994, Parallel branch-and-bound algorithms: Survey and synthesis, Operations Research, 42, 1042, 10.1287/opre.42.6.1042
Goldberg, 1989
Hooker, 2000
Ismail, 2010, A parallel branch and bound algorithm for solving large scale integer multiobjective problems, 1
Jorge, 2010
Jozefowiez, 2012, A generic branch-and-cut algorithm for multiobjective optimization problems: Application to the multilabel traveling salesman problem, INFORMS Journal on Computing, 24, 554, 10.1287/ijoc.1110.0476
Kellerer, 2004
Kirlik, 2015, Computing the nadir point for multiobjective discrete optimization problems, Journal of Global Optimization, 62, 79, 10.1007/s10898-014-0227-6
Kiziltan, 1983, An algorithm for multiobjective zero-one linear programming, Management Science, 29, 1444, 10.1287/mnsc.29.12.1444
Klamroth, 2015, On the representation of the search region in multi-objective optimization, European Journal of Operational Research, 245, 767, 10.1016/j.ejor.2015.03.031
Köksalan, 2015, Finding nadir points in multi-objective integer programs, Journal of Global Optimization, 62, 55, 10.1007/s10898-014-0212-0
Kubica, 2008, Interval methods for computing the pareto-front of a multicriterial problem, Vol. 4967, 1382
Marinescu, 2009, Exploiting problem decomposition in multi-objective constraint optimization, Vol. 5732, 592
Martello, 1990
Martin, 2014
Martin, 2014, On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach, Journal of Global Optimization, 1
Mavrotas, 1998, A branch and bound algorithm for mixed zero-one multiple objective linear programming, European Journal of Operational Research, 107, 530, 10.1016/S0377-2217(97)00077-5
Mavrotas, 2005, Multi-criteria branch and bound: A vector maximization algorithm for Mixed 0–1 Multiple Objective Linear Programming, Applied Mathematics and Computation, 171, 53, 10.1016/j.amc.2005.01.038
Mezmaz, 2007, A grid-based parallel approach of the multi-objective branch and bound, 23
2004, Vol. 27
Özpeynirci, 2010, An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs, Management Science, 56, 2302, 10.1287/mnsc.1100.1248
Parragh, S. N., & Tricoire, F. (2014). Branch-and-bound for bi-objective optimization. http://www.optimization-online.org/DB_HTML/2014/07/4444.html.
Przybylski, 2010, A recursive algorithms for finding all nondominated extreme points in the outcome set of a multiobjective integer program, INFORMS Journal on Computing, 22, 371, 10.1287/ijoc.1090.0342
Przybylski, 2010, A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives, Discrete Optimization, 7, 149, 10.1016/j.disopt.2010.03.005
Ramos, 1998, The problem of the optimal biobjective spanning tree, European Journal of Operational Research, 111, 617, 10.1016/S0377-2217(97)00391-3
Reiter, 2012, Exact hybrid algorithms for solving a bi-objective vehicle routing problem, Central European Journal of Operations Research, 20, 19, 10.1007/s10100-010-0158-3
Rollon, 2009, Constraint optimization techniques for exact multi-objective optimization, Vol. 618, 89
Rong, 2014, Dynamic programming algorithms for the bi-objective integer knapsack problem, European Journal of Operational Research, 236, 85, 10.1016/j.ejor.2013.11.032
Ruzika, 2005, Approximation methods in multiobjective programming, Journal of Optimization Theory and Applications, 126, 473, 10.1007/s10957-005-5494-4
Sourd, 2008, A multiobjective branch-and-bound framework: Application to the biobjective spanning tree problem, INFORMS Journal on Computing, 20, 472, 10.1287/ijoc.1070.0260
Stidsen, T. (2014). Personal communication.
Stidsen, 2015, Optimized parallel branch & cut algorithm for bi-objective TSP
Stidsen, 2014, A branch and bound algorithm for a class of biobjective mixed integer programs, Management Science, 60, 1009, 10.1287/mnsc.2013.1802
Talbi, 2008, Parallel approaches for multiobjective optimization, Vol. 5252, 349
Ulungu, 1997, Solving multi-objective knapsack problem by a branch-and-bound procedure, 269
Villarreal, 1981, Multicriteria integer programming: A (hybrid) dynamic programming recursive approach, Mathematical Programming, 21, 204, 10.1007/BF01584241
Vincent, 2013, Multiple objective branch and bound for mixed 0–1 linear programming: Corrections and improvements for the biobjective case, Computers & Operations Research, 40, 498, 10.1016/j.cor.2012.08.003
Visée, 1998, Two-phases method and branch and bound procedures to solve the bi-obective knapsack problem, Journal of Global Optimization, 12, 139, 10.1023/A:1008258310679
Zhang, 2008