Journal: RAIRO Operations Research

Found 507 papers in total
Augmented Lagrangian methods for variational inequality problems
Augmented Lagrangian methods for variational inequality problems
2010,
We introduce augmented Lagrangian methods for solving finite dimensional variational...
Perfectly matchable subgraph problem on a bipartite graph
Perfectly matchable subgraph problem on a bipartite graph
2010,
We consider the maximum weight perfectly matchable subgraph problem on a bipartite...
Explicit polyhedral approximation of the Euclidean ball
Explicit polyhedral approximation of the Euclidean ball
2010,
We discuss the problem of computing points of I R n whose convex hull contains the...
An efficient ILP formulation for the single machine scheduling problem
An efficient ILP formulation for the single machine scheduling problem
2010,
This paper considers the problem of scheduling n jobs on a single machine. A fixed...
Clique-connecting forest and stable set polytopes
Clique-connecting forest and stable set polytopes
2010,
Let G=(V,E) be a simple undirected graph. A forest F of G is said to be...
Advanced approach for the public transportation regulation system based on cybercars
Advanced approach for the public transportation regulation system based on cybercars
2010,
In the last decade, the authorities require the use of safe, comfortable vehicles to...
A short note on marginal analysis of a transportation problem
A short note on marginal analysis of a transportation problem
2009,
Decision analysis is a structured approach to decision-making, which allows managers...
Recherche à voisinage variable de graphes extrémaux 26. Nouveaux résultats sur la maille
Recherche à voisinage variable de graphes extrémaux 26. Nouveaux résultats sur la maille
2009,
Using the AutoGraphiX 2 system (AGX2), we study relations between graph invariants.
Decrease of C1,1 property in vector optimization
Decrease of C1,1 property in vector optimization
2009,
In the paper we generalize sufficient and necessary optimality conditions obtained by...
France Telecom workforce scheduling problem: a challenge
France Telecom workforce scheduling problem: a challenge
2009,
In this paper, we describe the methodology used to tackle France Telecom workforce...
Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications
Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications
2009,
The Technicians and Interventions Scheduling Problem for Telecommunications embeds the...
Incorporating the strength of MIP modeling in schedule construction
Incorporating the strength of MIP modeling in schedule construction
2009,
Linear programming techniques can be used in constructing schedules but their...
Méthode heuristique pour le problème de flow shop hybride avec machines dédiées
Méthode heuristique pour le problème de flow shop hybride avec machines dédiées
2009,
In this paper we deal with the two-stage hybrid flow shop with dedicated machines. The...
GTES : une méthode de simulation par jeux et apprentissage pour l'analyse des systèmes d'acteurs
GTES : une méthode de simulation par jeux et apprentissage pour l'analyse des systèmes d'acteurs
2009,
This paper proposes an approach towards modeling an actor system, especially suited to...
New results about impartial solitaire clobber
New results about impartial solitaire clobber
2009,
Impartial Solitaire Clobber is a one-player version of the combinatorial game Clobber,...
A continuous optimization model for a joint problem of pricing and resource allocation
A continuous optimization model for a joint problem of pricing and resource allocation
2009,
This paper investigates the problem of maximizing the revenue of a telecommunications...
A polynomial algorithm for minDSC on a subclass of series parallel graphs
A polynomial algorithm for minDSC on a subclass of series parallel graphs
2009,
The aim of this paper is to show a polynomial algorithm for the problem minimum...
Tractable algorithms for chance-constrained combinatorial problems
Tractable algorithms for chance-constrained combinatorial problems
2009,
This paper aims at proposing tractable algorithms to find effectively good solutions...
Kernel-function based algorithms for semidefinite optimization
Kernel-function based algorithms for semidefinite optimization
2009,
Recently, the authors introduced a new class of so-called eligible kernel functions...
Nonconvex duality and semicontinuous proximal solutions of HJB equation in optimal control
Nonconvex duality and semicontinuous proximal solutions of HJB equation in optimal control
2009,
In this work, we study an optimal control problem dealing with differential inclusion....
Separability by semivalues modified for games with coalition structure
Separability by semivalues modified for games with coalition structure
2009,
Two games are inseparable by semivalues if both games obtain the same allocation...
The behavior of a Markov network with respect to an absorbing class: the target algorithm
The behavior of a Markov network with respect to an absorbing class: the target algorithm
2009,
In this paper, we face a generalization of the problem of finding the distribution of...
From L. Euler to D. König
From L. Euler to D. König
2009,
Starting from the famous Königsberg bridge problem which Euler described in 1736,...
About the meaning of dependencies between criteria meaning: how to take them into account for decision aiding?
About the meaning of dependencies between criteria meaning: how to take them into account for decision aiding?
2009,
Let F be a family of criteria built for assessing a comprehensive preference model on...
Papers per page: