Country: France

Found 511 papers in total
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...
Subharmonic solutions of a nonconvex noncoercive Hamiltonian system
Subharmonic solutions of a nonconvex noncoercive Hamiltonian system
2004,
In this paper we study the existence of subharmonic solutions of the Hamiltonian...
On the central path for nonlinear semidefinite programming
On the central path for nonlinear semidefinite programming
2000,
In this paper we study the well definedness of the central path associated to a given...
Fractional programming: a guided tour of applications and solution methods
Fractional programming: a guided tour of applications and solution methods
1999,
Fractional programming consists in optimizing a ratio of two functions subject to some...
Continuous time linear-fractional programming. The minimum-risk approach
Continuous time linear-fractional programming. The minimum-risk approach
2000,
No abstract.
Convergence of prox-regularization methods for generalized fractional programming
Convergence of prox-regularization methods for generalized fractional programming
2002,
We analyze the convergence of the prox-regularization algorithms introduced by Gugat,...
Modelling integer linear programs with Petri nets
Modelling integer linear programs with Petri nets
2000,
We show in this paper that timed Petri nets, with one resource shared by all the...
Papers per page: