Finding non dominated points for multiobjective integer convex programs with linear constraints
From MaRDI portal
Recommendations
- Finding all nondominated points of multi-objective integer programs
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- Efficient cuts for generating the non-dominated vectors for Multiple Objective Integer Linear Programming
- A new method for optimizing a linear function over the efficient set of a multiobjective integer program
- A decision space algorithm for multiobjective convex quadratic integer optimization
Cites work
- scientific article; zbMATH DE number 4010155 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 2209474 (Why is no real title available?)
- A branch-and-cut technique to solve multiobjective integer quadratic programming problems
- A decision space algorithm for multiobjective convex quadratic integer optimization
- A modified method for constructing efficient solutions structure of MOLP
- A survey of recent developments in multiobjective optimization
- Adjacency based method for generating maximal efficient faces in multiobjective linear programming
- An approximation algorithm for convex multi-objective programming problems
- An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
- Determining maximal efficient faces in multiobjective linear programming problem
- Efficient cuts for generating the non-dominated vectors for Multiple Objective Integer Linear Programming
- Efficient solution generation for multiple objective linear programming based on extreme ray generation method
- Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
- Finding all maximal efficient faces in multiobjective linear programming
- In Memoriam: Shabbir Ahmed (1969–2019)
- Linear and nonlinear programming
- Multicriteria Optimization
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
- Reconciling franchisor and franchisee: a planar biobjective competitive location and design model
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
- Solving multiobjective mixed integer convex optimization problems
- Solving the Multiple Objective Integer Linear Programming Problem
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
Cited in
(14)- scientific article; zbMATH DE number 404613 (Why is no real title available?)
- Competition-based two-stage evolutionary algorithm for constrained multi-objective optimization
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
- Finding a representative nondominated set for multi-objective mixed integer programs
- Finding all nondominated points of multi-objective integer programs
- On the number of non-dominated points of a multicriteria optimization problem
- GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs
- An algorithm for approximating nondominated points of convex multiobjective optimization problems
- Efficient cuts for generating the non-dominated vectors for Multiple Objective Integer Linear Programming
- An efficient branch-and-bound algorithm to optimize a function over a nondominated set
- Finding nadir points in multi-objective integer programs
This page was built for publication: Finding non dominated points for multiobjective integer convex programs with linear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2162515)
