Computation of ideal and Nadir values and implications for their use in MCDM methods

Article Abstract:

The problem of finding the Nadir point for multicriteria optimization problems (MOP) is investigated. Some existing methods and heuristics are reviewed and some new ones are also discussed. A general method is proposed to compute Nadir values based on theoretical results on Pareto optimal solutions of subproblems with few criteria.

Multiple criteria decision making

---

Dominant, an algorithm for the p-center problem

Article Abstract:

Dominant, an algorithm for the p-center problem is analyzed. The algorithm is reported to solve a series of set covering problems and according to predefined maximum distance it has four versions, two of which can solve optimally problems with up to 900 demand points.

Algorithms, Algorithm

---

Augmented neural networks for task scheduling

Article Abstract:

A new approach, called Augmented Neural Networks (AugNN) is proposed for solving the task-scheduling problem. The approach is a hybrid of the heuristic and the neural networks approaches.

Neural networks, Scheduling (Management), Neural network

Similar abstracts:

• Abstracts: Foundations and applications of a knowledge management scan. Knowledge sharing in an emerging network of practice: the role of a knowledge portal
• Abstracts: Variable neighborhood tabu search and its application to the median cycle problem. Relaxation of the Condorcet and Simpson conditions in voting location
• Abstracts: Bertrand competition under cost uncertainty. Collusion under yardstick competition: an experimental study
• Abstracts: Competitiveness and evolution of family businesses: the role of family and business orientation
• Abstracts: Three approximation algorithms for solving the generalized segregated storage problem. The interactive analysis of the multicriteria shortest path problem by the reference point method

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.