Evaluation of nondominated solution sets for k-objective optimization problems: an exact method and approximations
From MaRDI portal
Publication:2496079
Recommendations
- Quantitative comparison of approximate solution sets for multicriteria optimization problems with weighted Tchebycheff preference function
- Evaluating solutions and solution sets under multiple objectives
- Interactive polyhedral outer approximation (IPOA) strategy for general multiobjective optimization problems
- Evaluating solution sets of a posteriori solution techniques for bi-criteria combinatorial optimization problems
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
Cites work
- A framework for sensitivity analysis in discrete multi-objective decision-making
- A multiple criteria method for choosing among discrete alternatives
- An Interactive Programming Method for Solving the Multiple Criteria Problem
- Comparative studies in interactive multiple objective mathematical programming
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- Evaluating solution sets of a posteriori solution techniques for bi-criteria combinatorial optimization problems
- Evaluation of nondominated solution sets for \(k\)-objective optimization problems: an exact method and approximations
- Generating random vectors uniformly distributed inside and on the surface of different regions
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 1538124 (Why is no real title available?)
- scientific article; zbMATH DE number 1784650 (Why is no real title available?)
- scientific article; zbMATH DE number 1858037 (Why is no real title available?)
- Identifying Efficient Vectors: Some Theory and Computational Results
- Mathematical programming and the sensitivity of multi-criteria decisions
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- The quickhull algorithm for convex hulls
- Using metaheuristics in multiobjective resource constrained project scheduling
Cited in
(6)- Evaluating solutions and solution sets under multiple objectives
- Evaluation of nondominated solution sets for \(k\)-objective optimization problems: an exact method and approximations
- Quantitative comparison of approximate solution sets for multicriteria optimization problems with weighted Tchebycheff preference function
- Structural properties of Pareto fronts: the occurrence of dents in classical and parametric multiobjective optimization problems
- An interactive algorithm for multiobjective ranking for underlying linear and quasiconcave value functions
- Evaluating solution sets of a posteriori solution techniques for bi-criteria combinatorial optimization problems
This page was built for publication: Evaluation of nondominated solution sets for \(k\)-objective optimization problems: an exact method and approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2496079)