3557 results in Optimization
Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée
-
- Journal:
- RAIRO - Operations Research / Volume 35 / Issue 4 / October 2001
- Published online by Cambridge University Press:
- 15 August 2002, pp. 401-414
- Print publication:
- October 2001
-
- Article
- Export citation
Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
-
- Journal:
- RAIRO - Operations Research / Volume 35 / Issue 4 / October 2001
- Published online by Cambridge University Press:
- 15 August 2002, pp. 415-438
- Print publication:
- October 2001
-
- Article
- Export citation
A modified algorithm for the strict feasibility problem
-
- Journal:
- RAIRO - Operations Research / Volume 35 / Issue 4 / October 2001
- Published online by Cambridge University Press:
- 15 August 2002, pp. 395-399
- Print publication:
- October 2001
-
- Article
- Export citation
A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ
-
- Journal:
- RAIRO - Operations Research / Volume 35 / Issue 4 / October 2001
- Published online by Cambridge University Press:
- 15 August 2002, pp. 383-394
- Print publication:
- October 2001
-
- Article
- Export citation
Tarification par des jeux Coopératifs avec Demandes Élastiques
-
- Journal:
- RAIRO - Operations Research / Volume 35 / Issue 3 / July 2001
- Published online by Cambridge University Press:
- 15 August 2002, pp. 367-381
- Print publication:
- July 2001
-
- Article
- Export citation
État de l'art des méthodes “d'optimisation globale”
-
- Journal:
- RAIRO - Operations Research / Volume 35 / Issue 3 / July 2001
- Published online by Cambridge University Press:
- 15 August 2002, pp. 329-365
- Print publication:
- July 2001
-
- Article
- Export citation
Efficient and Local Efficient Solutions for Assignment Type Problems
-
- Journal:
- RAIRO - Operations Research / Volume 35 / Issue 3 / July 2001
- Published online by Cambridge University Press:
- 15 August 2002, pp. 301-313
- Print publication:
- July 2001
-
- Article
- Export citation
Finding the principal points of a random variable
-
- Journal:
- RAIRO - Operations Research / Volume 35 / Issue 3 / July 2001
- Published online by Cambridge University Press:
- 15 August 2002, pp. 315-328
- Print publication:
- July 2001
-
- Article
- Export citation
Separable convexification and DCA techniques for capacity and flow assignment problems
-
- Journal:
- RAIRO - Operations Research / Volume 35 / Issue 2 / April 2001
- Published online by Cambridge University Press:
- 15 August 2002, pp. 269-281
- Print publication:
- April 2001
-
- Article
- Export citation
Fast simulation for Road Traffic Network
-
- Journal:
- RAIRO - Operations Research / Volume 35 / Issue 2 / April 2001
- Published online by Cambridge University Press:
- 15 August 2002, pp. 229-250
- Print publication:
- April 2001
-
- Article
- Export citation
Resource allocation in a mobile telephone network: A constructive repair algorithm
-
- Journal:
- RAIRO - Operations Research / Volume 35 / Issue 2 / April 2001
- Published online by Cambridge University Press:
- 15 August 2002, pp. 189-209
- Print publication:
- April 2001
-
- Article
- Export citation
Minimizing the Earliness and Tardiness Cost of a Sequence of Tasks on a Single Machine
-
- Journal:
- RAIRO - Operations Research / Volume 35 / Issue 2 / April 2001
- Published online by Cambridge University Press:
- 15 August 2002, pp. 165-187
- Print publication:
- April 2001
-
- Article
- Export citation
Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List
-
- Journal:
- RAIRO - Operations Research / Volume 35 / Issue 2 / April 2001
- Published online by Cambridge University Press:
- 15 August 2002, pp. 251-267
- Print publication:
- April 2001
-
- Article
- Export citation
Multicriteria scheduling problems: a survey
-
- Journal:
- RAIRO - Operations Research / Volume 35 / Issue 2 / April 2001
- Published online by Cambridge University Press:
- 15 August 2002, pp. 143-163
- Print publication:
- April 2001
-
- Article
- Export citation
The triangles method to build X-trees from incomplete distance matrices
-
- Journal:
- RAIRO - Operations Research / Volume 35 / Issue 2 / April 2001
- Published online by Cambridge University Press:
- 15 August 2002, pp. 283-300
- Print publication:
- April 2001
-
- Article
- Export citation
Semi-Definite positive Programming Relaxations for Graph Kn-Coloring in Frequency Assignment
-
- Journal:
- RAIRO - Operations Research / Volume 35 / Issue 2 / April 2001
- Published online by Cambridge University Press:
- 15 August 2002, pp. 211-228
- Print publication:
- April 2001
-
- Article
- Export citation
Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals
-
- Journal:
- RAIRO - Operations Research / Volume 35 / Issue 1 / January 2001
- Published online by Cambridge University Press:
- 15 August 2002, pp. 71-83
- Print publication:
- January 2001
-
- Article
- Export citation
On Minimizing Total Tardiness in a Serial Batching Problem
-
- Journal:
- RAIRO - Operations Research / Volume 35 / Issue 1 / January 2001
- Published online by Cambridge University Press:
- 15 August 2002, pp. 107-115
- Print publication:
- January 2001
-
- Article
- Export citation
Solving the simple plant location problem by genetic algorithm
-
- Journal:
- RAIRO - Operations Research / Volume 35 / Issue 1 / January 2001
- Published online by Cambridge University Press:
- 15 August 2002, pp. 127-142
- Print publication:
- January 2001
-
- Article
- Export citation
Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem
-
- Journal:
- RAIRO - Operations Research / Volume 35 / Issue 1 / January 2001
- Published online by Cambridge University Press:
- 15 August 2002, pp. 117-126
- Print publication:
- January 2001
-
- Article
- Export citation