The triangle splitting method for biobjective mixed integer programming

DOI10.1007/978-3-319-07557-0_14MaRDI QIDQ5418993zbMATH OpenOpenAlexFDO

Authors Natashia Boland, Hadi Charkhgard, Martin W. P. Savelsbergh

Publication date 2 June 2014

Published in Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-07557-0_14

zbMATH Keywords

efficient frontiertriangle splitting methodbi-objective mixed integer program

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Mixed integer programming (90C11)

Recommendations

• A criterion space search algorithm for biobjective mixed integer programming: the triangle splitting method
• An exact algorithm for biobjective mixed integer linear programming problems
• A criterion space search algorithm for biobjective integer programming: the balanced box method
• Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
• The \(L\)-shape search method for triobjective integer programming

Cited in

(15)

• Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming
• A criterion space search algorithm for biobjective mixed integer programming: the triangle splitting method
• Multiobjective Integer Programming: Synergistic Parallel Approaches
• A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems
• The \(L\)-shape search method for triobjective integer programming
• Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
• An exact algorithm for biobjective mixed integer linear programming problems
• Split algorithms for multiobjective integer programming problems
• An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets
• A parallel approach to bi-objective integer programming
• A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions
• Solving multiobjective mixed integer convex optimization problems
• A criterion space search algorithm for biobjective integer programming: the balanced box method
• Bi-objective matchings with the triangle inequality
• Bi-objective optimisation over a set of convex sub-problems

This page was built for publication: The triangle splitting method for biobjective mixed integer programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5418993)