Journal: RAIRO Operations Research

Found 507 papers in total
Dynamic scheduling of stochastic tasks on a single processor
Dynamic scheduling of stochastic tasks on a single processor
2002,
We show that a particular dynamic priority given to jobs in a multitasks operating...
Fast simulation for road traffic network
Fast simulation for road traffic network
2001,
In this paper we present a method to perform fast simulation of large Markovian...
Approximation algorithms for the design of SDH/SONET networks
Approximation algorithms for the design of SDH/SONET networks
2003,
In this paper, a graph partitioning problem that arises in the design of SONET/SDH...
Bottleneck capacity expansion problems with general budget constraints
Bottleneck capacity expansion problems with general budget constraints
2001,
This paper presents a unified approach for bottleneck capacity expansion problems. In...
Heuristic and metaheuristic methods for computing graph treewidth
Heuristic and metaheuristic methods for computing graph treewidth
2004,
The notion of treewidth is of considerable interest in relation to NP-hard problems....
Two new classes of trees embeddable into hypercubes
Two new classes of trees embeddable into hypercubes
2004,
The problem of embedding graphs into other graphs is much studied in the graph theory....
A unified formulation and approach to the analysis of approximation algorithms
A unified formulation and approach to the analysis of approximation algorithms
2002,
The main objective of the polynomial approximation is the development of polynomial...
Load transfer on a totally connected processor network
Load transfer on a totally connected processor network
2000,
In this paper, a model of the load transfer on a fully connected net is presented....
Simulation of transient performance measures for stiff Markov chains
Simulation of transient performance measures for stiff Markov chains
2000,
We consider the simulation of transient performance measures of high reliable...
Generalised queue networks in a stochastic environment
Generalised queue networks in a stochastic environment
2000,
We study networks with positive and negative customers (or Generalized networks of...
A problem on Markov chains
A problem on Markov chains
2002,
A problem (arisen from applications to networks) is posed about the principal minors...
Transforming stochastic matrices for stochastic comparison with the st-order
Transforming stochastic matrices for stochastic comparison with the st-order
2003,
We present a transformation for stochastic matrices and analyze the effects of using...
Using Max-Plus algebra to generalise some lower bounds on flowshop scheduling
Using Max-Plus algebra to generalise some lower bounds on flowshop scheduling
2003,
The traditional flowshop scheduling problem can be generalised to a matricial...
The variance location problem on a network with continuously distributed demand
The variance location problem on a network with continuously distributed demand
2000,
Most location problems on the networks consider discrete nodal demand. However, for...
A new relaxation in conic form for the Suclidean Steiner problem in ℜn
A new relaxation in conic form for the Suclidean Steiner problem in ℜn
2001,
In this paper, we present a new mathematical programming formulation for the Euclidean...
A new transformation of generalized Petri nets
A new transformation of generalized Petri nets
2004,
This paper introduces a new transformation of generalized Petri nets. This...
Fast approximation of minimum multicast congestion – implementation versus theory
Fast approximation of minimum multicast congestion – implementation versus theory
2004,
The problem of minimizing the maximum edge congestion in a multicast communication...
A variational model for equilibrium problems in a traffic network
A variational model for equilibrium problems in a traffic network
2004,
We propose a variational model for one of the most important problems in traffic...
A generalization of dynamic programming for Pareto optimization in dynamic networks
A generalization of dynamic programming for Pareto optimization in dynamic networks
2000,
The algorithm in this paper is designed to find the shortest path in a network given...
The maximum capacity shortest path problem: generation of efficient solution sets
The maximum capacity shortest path problem: generation of efficient solution sets
2002,
Individual items of flow in a telecommunications or a transportation network may need...
Collinearity and numerical instabilities in numerical solution of linear models
Collinearity and numerical instabilities in numerical solution of linear models
2000,
In this paper we give the expression of the multiple correlation coefficient in a...
Strict convex regularizations, proximal points and augmented Lagrangians
Strict convex regularizations, proximal points and augmented Lagrangians
2000,
Proximal Point Methods (PPM) can be traced to the pioneer works of Moreau, Martinet...
Generalized characterization of the convex envelope of a function
Generalized characterization of the convex envelope of a function
2002,
We investigate the minima of functionals of the form ∫ [a,b] g(&udot;(s))ds where...
A derivation of Lovász' theta via augmented Lagrange duality
A derivation of Lovász' theta via augmented Lagrange duality
2003,
A recently introduced dualization technique for binary linear programs with equality...
Papers per page: