SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems

Cites Work

Multi-objective integer programming: an improved recursive algorithm
Multicriteria optimization
A revised simplex method for linear multiple objective programs
Multiobjective optimization. Interactive and evolutionary approaches
An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
A survey of recent developments in multiobjective optimization
An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed 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
Multi-objective integer programming: a general approach for generating all non-dominated solutions
Fathoming rules for biobjective mixed integer linear programs: review and extensions
A method for finding the set of non-dominated vectors for multiple objective integer linear programs
A discussion of scalarization techniques for multiple objective integer programming
A criterion space search algorithm for biobjective integer programming: the balanced box method
The \(L\)-shape search method for triobjective integer programming
Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
Finding all nondominated points of multi-objective integer programs
An interactive weighted Tchebycheff procedure for multiple objective programming
An exact algorithm for biobjective mixed integer linear programming problems
The set of all nondominated solutions in linear cases and a multicriteria simplex method
An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
An algorithm for optimizing a linear function over an integer efficient set
A criterion space search algorithm for biobjective mixed integer programming: the triangle splitting method
A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme
Graphical exploration of the weight space in three-objective mixed integer linear programs
The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
On the efficient point set of tricriteria linear programs
A multiobjective optimization model of production-sourcing for sustainable supply chain with consideration of social, environmental, and economic factors
A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems
GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs

Cited In (2)

A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs
Solving Multiobjective Mixed Integer Convex Optimization Problems

Uses Software

MOIP_AIRA

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

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