Disjunctive Programming for Multiobjective Discrete Optimisation

References

• Balas E (1998) Disjunctive programming: Properties of the convex hull of feasible points. Discrete Appl. Math. 89(1–3):3–44.Crossref, Google Scholar
• Bitran E (1977) Linear multiple objective programs with zero-one variables. Math. Programming 13(1):121–139.Crossref, Google Scholar
• Ehrgott M, Gandibleux X (2000) A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spektrum 22(4):425–460.Crossref, Google Scholar
• Ehrgott M, Gandibleux X, Przybylski A (2016) Exact methods for multi-objective combinatorial optimisation. Greco S, Ehrgott M, Figueira JR, eds. Multiple Criteria Decision Analysis. International Series in Operations Research and Management Science, Vol. 233 (Springer, New York), 817–850.Crossref, Google Scholar
• Gavish B, Graves SC (1978) The traveling salesman problem and related problems. Working Paper OR-078-78, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA.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
• Kirlik G, Sayin 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
• 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
• Laumanns M, Thiele L, Zitzler E (2006) An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method. Eur. J. Oper. Res. 169(3):932–942.Crossref, Google Scholar
• Lokman B, Köksalan M (2013) Finding all nondominated points of multi-objective integer programs. J. Global Optim. 57(2):347–365.Crossref, Google Scholar
• Özlen M, Azizoğlu M (2009) Multi-objective integer programming: A general approach for generating all non-dominated solutions. Eur. J. Oper. Res. 199(1):25–35.Crossref, Google Scholar
• Özpeynirci Ö, Köksalan M (2010) An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs. Management Sci. 56(12):2302–2315.Link, Google Scholar
• Przybylski A, Gandibleux X, Ehrgott M (2010a) A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives. Discrete Optim. 7(3):149–165.Crossref, Google Scholar
• Przybylski A, Gandibleux X, Ehrgott M (2010b) A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme. INFORMS J. Comput. 22(3):371–386.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
• 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
• Trespalacios F, Grossmann IE (2015) Improved Big-M reformulation for generalized disjunctive programs. Comput. Chemical Engrg. 76:98–103.Crossref, Google Scholar
• Vielma JP (2015) Mixed integer linear programming formulation techniques. SIAM Rev. 57(1):3–57.Crossref, Google Scholar