The Triangle Splitting Method for Biobjective Mixed Integer Programming

DOI10.1007/978-3-319-07557-0_14zbMath1418.90244OpenAlexW2198667856MaRDI QIDQ5418993

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

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

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

Related Items (8)

Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming ⋮ Solving Multiobjective Mixed Integer Convex Optimization Problems ⋮ A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions ⋮ A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems ⋮ An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets ⋮ A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method ⋮ Multiobjective Integer Programming: Synergistic Parallel Approaches ⋮ 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