SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems
DOI10.1007/s10479-019-03422-9zbMath1467.90069OpenAlexW2981279512WikidataQ126997249 ScholiaQ126997249MaRDI QIDQ828878
Seyyed Amir Babak Rasmi, Ali Fattahi, Metin Turkay
Publication date: 5 May 2021
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-019-03422-9
mixed-integer linear programmingexact methodlexicographic optimizationnon-dominated facesnon-dominated pointstri-objective programming
Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Linear programming (90C05)
Related Items (2)
Uses Software
Cites Work
- The \(L\)-shape search method for triobjective integer programming
- Graphical exploration of the weight space in three-objective mixed integer linear programs
- 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
- Finding all nondominated points of multi-objective integer programs
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- Multiobjective optimization. Interactive and evolutionary approaches
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- On the efficient point set of tricriteria linear programs
- An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
- Multicriteria optimization
- A multiobjective optimization model of production-sourcing for sustainable supply chain with consideration of social, environmental, and economic factors
- Fathoming rules for biobjective mixed integer linear programs: review and extensions
- The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
- A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- Multi-objective integer programming: an improved recursive algorithm
- GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs
- An algorithm for optimizing a linear function over an integer efficient set
- A discussion of scalarization techniques for multiple objective integer programming
- A survey of recent developments in multiobjective optimization
- A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method
- A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method
- A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
- An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
- An interactive weighted Tchebycheff procedure for multiple objective programming
- A revised simplex method for linear multiple objective programs
This page was built for publication: SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems
