Computation of ideal and Nadir values and implications for their use in MCDM methods.
From MaRDI portal
Publication:1406960
DOI10.1016/S0377-2217(02)00595-7zbMATH Open1043.90039OpenAlexW2056289270MaRDI QIDQ1406960FDOQ1406960
Recommendations
- scientific article; zbMATH DE number 1784660
- Computing the nadir point for multiobjective discrete optimization problems
- An exact method for computing the nadir values in multiple objective linear programming
- Nadir Point Estimation Using Evolutionary Approaches: Better Accuracy and Computational Speed Through Focused Search
- A Heuristic for Estimating Nadir Criterion Values in Multiple Objective Linear Programming
Cites work
- scientific article; zbMATH DE number 3833720 (Why is no real title available?)
- scientific article; zbMATH DE number 4091200 (Why is no real title available?)
- scientific article; zbMATH DE number 3694968 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1241874 (Why is no real title available?)
- scientific article; zbMATH DE number 915988 (Why is no real title available?)
- A Heuristic for Estimating Nadir Criterion Values in Multiple Objective Linear Programming
- A bicriterion shortest path algorithm
- A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- A naïve approach for solving MCDM problems: the GUESS method
- A survey and annotated bibliography of multiobjective combinatorial optimization
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- Approximating the noninferior set in multiobjective linear programming problems
- Bicriteria network flow problems: Integer case
- Careful usage of pessimistic values is needed in multiple objectives optimization
- Computational experience concerning payoff tables and minimum criterion values over the efficient set
- Conical algorithm in global optimization for optimizing over efficient sets
- Dual approach to minimization on the set of Pareto-optimal solutions
- Efficient spanning trees
- Interactive bundle-based method for nondifferentiable multiobjeective optimization: nimbus§
- Linear programming with multiple objective functions: Step method (stem)
- Maximizing a concave function over the efficient or weakly-efficient set
- Multicriteria network location problems with sum objectives
- Multicriteria optimization
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- Optimization over the efficient set
- Optimization over the efficient set
- Optimization over the efficient set using an active constraint approach
- Optimizing a linear function over an efficient set
- Pairwise-comparison methods in multiple objective programming, with applications in a long-term energy-planning model
- Proper Efficiency in Nonconvex Multicriteria Programming
- The problem of the optimal biobjective spanning tree
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- Theory of multiobjective optimization
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- Uncertainty and method choice in discrete multiobjective programming problems
- Utility function programs and optimization over the efficient set in multiple-objective decision making
Cited in
(40)- Bound sets for biobjective combinatorial optimization problems
- Variable preference modeling with ideal-symmetric convex cones
- Application of a hybrid intelligent decision support model in logistics outsourcing
- Modified interactive Chebyshev algorithm (MICA) for non-convex multiobjective programming
- scientific article; zbMATH DE number 1784660 (Why is no real title available?)
- Multi-objective branch and bound
- A new method for optimizing a linear function over the efficient set of a multiobjective integer program
- Modified interactive Chebyshev algorithm (MICA) for convex multiobjective programming
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- Heuristic for a new multiobjective scheduling problem
- Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- Incorporating preferential weights as a benchmark into a sequential reference point method
- A simple, efficient and versatile objective space algorithm for multiobjective integer programming
- Effective anytime algorithm for multiobjective combinatorial optimization problems
- NAUTILUS method: an interactive technique in multiobjective optimization based on the Nadir point
- On the number of non-dominated points of a multicriteria optimization problem
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem
- An exact method for computing the nadir values in multiple objective linear programming
- Multi-objective optimisation of positively homogeneous functions and an application in radiation therapy
- Interactive decision support in radiation therapy treatment planning
- On nadir points of multiobjective integer programming problems
- On the use of the \(L_{p}\) distance in reference point-based approaches for multiobjective optimization
- Towards a multi-objective performance assessment and optimization model of a two-echelon supply chain using SCOR metrics
- Bilevel programming for generating discrete representations in multiobjective optimization
- \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems
- A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
- Best compromise solution for a new multiobjective scheduling problem
- An introduction to multiobjective simulation optimization
- A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times
- Biobjective robust optimization over the efficient set for Pareto set reduction
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- The need for and possible methods of objective ranking
- A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions
- Characterizing coherence, correcting incoherence
- Advanced network connectivity features and zonal requirements in covering location problems
- Computing the nadir point for multiobjective discrete optimization problems
- Finding nadir points in multi-objective integer programs
- A preference-based evolutionary algorithm for multiobjective optimization: the weighting achievement scalarizing function genetic algorithm
This page was built for publication: Computation of ideal and Nadir values and implications for their use in MCDM methods.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1406960)
