Editorial
Clarisse Dhaenens, Patrick Siarry, El-Ghazali Talbi (2008)
RAIRO - Operations Research
Similarity:
Clarisse Dhaenens, Patrick Siarry, El-Ghazali Talbi (2008)
RAIRO - Operations Research
Similarity:
Mario Furnari, Antonio Massarotti (1988)
Stochastica
Similarity:
In this note we discuss some drawbacks of some approaches to the classification of NP-complete optimization problems. Then we analyze the Theory of Analytical Computational Complexity to gain some insight about the notions of approximation and approximate algorithms. We stress the different roles played by these notions within the theories of Analytical and Algebraic Complexity. We finally outline a possible strategy to capture a more useful notion of approximation which is inspired...
Jaroslav Hrouda (1976)
Aplikace matematiky
Similarity:
Jussi Hakanen, Yoshiaki Kawajiri, Kaisa Miettinen, Lorenz Biegler (2007)
Control and Cybernetics
Similarity:
José Luis Quintero, Alejandro Crema (2005)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The multiparametric min max 0-1-Integer Programming (0-1-IP) problem relative to the objective function is a family of min max 0-1-IP problems which are related by having identical constraint matrix and right-hand-side vector. In this paper we present an algorithm to perform a complete multiparametric analysis relative to the objective function.
V. T'kindt, J.-C. Billaut (2001)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
This paper presents a state-of-the-art survey on multicriteria scheduling and introduces a definition of a multicriteria scheduling problem. It provides a framework that allows to tackle multicriteria scheduling problems, according to Decision Aid concepts. This problem is decomposed into three different problems. The first problem is about obtaining a model. The second one is how to take criteria into account and the third one is about solving a scheduling problem. An extension to an...
John Sylva, Alejandro Crema (2008)
RAIRO - Operations Research
Similarity:
An algorithm for enumerating all nondominated vectors of multiple objective integer linear programs is presented. The method tests different regions where candidates can be found using an auxiliary binary problem for tracking the regions already explored. An experimental comparision with our previous efforts shows the method has relatively good time performance.