A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems
From MaRDI portal
Publication:1754103
DOI10.1016/j.ejor.2017.09.026zbMath1403.90605OpenAlexW2756508720MaRDI QIDQ1754103
Publication date: 30 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.09.026
Related Items
SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems ⋮ An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach ⋮ Solving Multiobjective Mixed Integer Convex Optimization Problems ⋮ A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs ⋮ A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method ⋮ GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs ⋮ Bi-objective optimisation over a set of convex sub-problems
Cites Work
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- An exact algorithm for biobjective mixed integer linear programming problems
- Survey of multi-objective optimization methods for engineering
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Multiobjective programming and planning
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- Fathoming rules for biobjective mixed integer linear programs: review and extensions
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems
- A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method
- Bicriteria Transportation Problem
- A revised simplex method for linear multiple objective programs
- The Triangle Splitting Method for Biobjective Mixed Integer Programming
- Convex Programming Methods for Global Optimization
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
This page was built for publication: A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems
