SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems
type: Item
instance of: scholarly article
title: SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems
zbMATH Open document ID: 1467.90069
author: Seyyed Amir Babak Rasmi
author: Ali Fattahi
author: Metin Türkay
published in: Annals of Operations Research
publication date: 2021-05-05T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 7344090
zbMATH Keywords: tri-objective programming
zbMATH Keywords: mixed-integer linear programming
zbMATH Keywords: non-dominated points
zbMATH Keywords: lexicographic optimization
zbMATH Keywords: exact method
zbMATH Keywords: non-dominated faces
describes a project that uses: MOIP_AIRA
MaRDI profile type: Publication
full work available at URL: s10479-019-03422-9
OpenAlex ID: W2981279512
cites work: An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
cites work: Graphical exploration of the weight space in three-objective mixed integer linear programs
cites work: Fathoming rules for biobjective mixed integer linear programs: review and extensions
cites work: A criterion space search algorithm for biobjective integer programming: the balanced box method
cites work: A criterion space search algorithm for biobjective mixed integer programming: the triangle splitting method
cites work: The \(L\)-shape search method for triobjective integer programming
cites work: The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
cites work: Multiobjective optimization. Interactive and evolutionary approaches
cites work: A multiobjective optimization model of production-sourcing for sustainable supply chain with consideration of social, environmental, and economic factors
cites work: A survey of recent developments in multiobjective optimization
cites work: Multicriteria optimization
cites work: A discussion of scalarization techniques for multiple objective integer programming
cites work: A revised simplex method for linear multiple objective programs
cites work: A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems
cites work: On the efficient point set of tricriteria linear programs
cites work: An algorithm for optimizing a linear function over an integer efficient set
cites work: Finding all nondominated points of multi-objective integer programs
cites work: Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
cites work: An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
cites work: Multi-objective integer programming: a general approach for generating all non-dominated solutions
cites work: Multi-objective integer programming: an improved recursive algorithm
cites work: An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
cites work: A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme
cites work: A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
cites work: GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs
cites work: An exact algorithm for biobjective mixed integer linear programming problems
cites work: An interactive weighted Tchebycheff procedure for multiple objective programming
cites work: A method for finding the set of non-dominated vectors for multiple objective integer linear programs
cites work: Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
cites work: The set of all nondominated solutions in linear cases and a multicriteria simplex method
Wikidata QID: Q126997249
DOI: 10.1007/S10479-019-03422-9
description: scientific article; zbMATH DE number 7344090