All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1 Next

Displaying 1 – 20 of 39

Showing per page

A survey on combinatorial optimization in dynamic environments∗

Nicolas Boria, Vangelis T. Paschos (2011)

RAIRO - Operations Research

This survey presents major results and issues related to the study of NPO problems in dynamic environments, that is, in settings where instances are allowed to undergo some modifications over time. In particular, the survey focuses on two complementary frameworks. The first one is the reoptimization framework, where an instance I that is already solved undergoes some local perturbation. The goal is then to make use of the information provided by the initial solution to compute a new solution. The...

A survey on combinatorial optimization in dynamic environments∗

Nicolas Boria, Vangelis T. Paschos (2011)

RAIRO - Operations Research

This survey presents major results and issues related to the study of NPO problems in dynamic environments, that is, in settings where instances are allowed to undergo some modifications over time. In particular, the survey focuses on two complementary frameworks. The first one is the reoptimization framework, where an instance I that is already solved undergoes some local perturbation. The goal is then to make use of the information provided by the initial solution to compute a new solution. The...

État de l’art des méthodes d’«optimisation globale»

Gérard Berthiau, Patrick Siarry (2001)

RAIRO - Operations Research - Recherche Opérationnelle

We present a review of the main “global optimization” methods. The paper comprises one introduction and two parts. In the introduction, we recall some generalities about non linear constraint-less optimization and we list some classifications which have been proposed for the global optimization methods. We then describe, in the first part, various “classical” global optimization methods, most of which available long before the appearance of Simulated Annealing (a key event in this field). There...

État de l'art des méthodes “d'optimisation globale”

Gérard Berthiau, Patrick Siarry (2010)

RAIRO - Operations Research

We present a review of the main “global optimization" methods. The paper comprises one introduction and two parts. In the introduction, we recall some generalities about non linear constraint-less optimization and we list some classifications which have been proposed for the global optimization methods. We then describe, in the first part, various “classical" global optimization methods, most of which available long before the appearance of Simulated Annealing (a key event in this field)....

Frequency planning and ramifications of coloring

Andreas Eisenblätter, Martin Grötschel, Arie M.C.A. Koster (2002)

Discussiones Mathematicae Graph Theory

This paper surveys frequency assignment problems coming up in planning wireless communication services. It particularly focuses on cellular mobile phone systems such as GSM, a technology that revolutionizes communication. Traditional vertex coloring provides a conceptual framework for the mathematical modeling of many frequency planning problems. This basic form, however, needs various extensions to cover technical and organizational side constraints. Among these ramifications are T-coloring and...

Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art

A. Vignier, J.-C. Billaut, C. Proust (2010)

RAIRO - Operations Research

A special class of scheduling problems is studied in this paper, named Hybrid Flowshop, n jobs have to be performed in a shop and each of them has the same routing (so this is a flowshop). A job consists in k different operations. A set of machines are able to perform each operation and this set is called a stage. So when a job consists in two operations, there are two stages in the shop. After introducing the scheduling generalities, we define our preocupations and we propose a notation in...

Multicriteria scheduling problems : a survey

V. T'kindt, J.-C. Billaut (2001)

RAIRO - Operations Research - Recherche Opérationnelle

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 existing notation...

Currently displaying 1 – 20 of 39

Page 1 Next