GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs
From MaRDI portal
Publication:2327904
DOI10.1007/s11081-018-9399-0zbMath1428.90156OpenAlexW2886005644WikidataQ129477175 ScholiaQ129477175MaRDI QIDQ2327904
Seyyed Amir Babak Rasmi, Metin Turkay
Publication date: 8 October 2019
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: http://cdm21054.contentdm.oclc.org/cdm/ref/collection/IR/id/8594
Related Items (3)
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The \(L\)-shape search method for triobjective integer programming
- Graphical exploration of the weight space in three-objective mixed integer linear programs
- An exact solution approach for multi-objective location-transportation problem for disaster response
- 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
- Multi-objective aerodynamic shape optimization for unsteady viscous flows
- Finding all nondominated points of multi-objective integer programs
- A \(k\), \(k-\epsilon\) optimality selection based multi objective genetic algorithm with applications to vehicle engineering
- A parametric simplex algorithm for linear vector optimization problems
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- A review of interactive methods for multiobjective integer and mixed-integer programming
- 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
- Finding all maximal efficient faces in multiobjective linear programming
- Determination of the efficient set in multiobjective linear programming
- Random problem genertion and the computation of efficient extreme points in multiple objective linear programming
- An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
- 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 new method for optimizing a linear function over the efficient set of a multiobjective integer program
- 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
- Bi-objective autonomous vehicle repositioning problem with travel time uncertainty
- Multi-objective integer programming: an improved recursive algorithm
- An algorithm for optimizing a linear function over an integer efficient set
- A discussion of scalarization techniques for multiple objective integer programming
- Primal-dual simplex method for multiobjective linear programming
- An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
- A method for generating all efficient solutions of 0-1 multi-objective linear programming problem
- 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
- 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: GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs
