Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Multi-objective Problems in Terms of Relational Algebra|
|Citation:||Relations and Kleene Algebra in Computer Science: 10th International Conference on Relational Methods in Computer Science, and 5th International Conference on Applications of Kleene Algebra, RelMiCS/AKA 2008, Frauenwörth, Germany, April 7-11, 2008. Proceedings / R. Berghammer, B. Möller, G. Struth (eds.), pp.84-98|
|Series/Report no.:||Lecture Notes in Computer Science|
|Conference Name:||International Conference on Relational Methods in Computer Science (10th : 2008 : Frauenwörth, Germany)|
|Florian Diedrich, Britta Kehden, and Frank Neumann|
|Abstract:||Relational algebra has been shown to be a powerful tool for solving a wide range of combinatorial optimization problems with small computational and programming effort. The problems considered in recent years are single- objective ones where one single objective function has to be optimized. With this paper we start considerations on the use of relational algebra for multi-objective problems. In contrast to singleobjective optimization multiple objective functions have to be optimized at the same time usually resulting in a set of different trade-offs with respect to the different functions. On the one hand, we examine how to solve the mentioned problem exactly by using relational algebraic programs. On the other hand, we address the problem of objective reduction that has recently been shown to be NP-hard. We propose an exact algorithm for this problem based on relational algebra. Our experimental results show that this algorithm drastically outperforms the currently best one.|
|Description:||Also published as a journal article: Lecture Notes in Computer Science, 2008; 4988:84-98|
|Rights:||© Springer-Verlag Berlin Heidelberg 2008|
|Appears in Collections:||Aurora harvest 5|
Computer Science publications
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.