Applications comparées des méthodes d'analyse multicritère UTA
Applicazioni di ricerca operativa nell’ambito del traffico aereo
Approximate evaluation of continuous review policies in two-echelon inventory systems with stochastic transportation times
This paper considers a distribution inventory system that consists of a single warehouse and several retailers. Customer demand arrives at the retailers according to a continuous-time renewal process. Material flow between echelons is driven by reorder point/order quantity inventory control policies. Our objective in this setting is to calculate the long-run inventory, backorder and customer service levels. The challenge in this system is to characterize the demand arrival process at the warehouse....
Approximation algorithms for the design of SDH/SONET networks
In this paper, a graph partitioning problem that arises in the design of SONET/SDH networks is defined and formalized. Approximation algorithms with performance guarantees are presented. To solve this problem efficiently in practice, fast greedy algorithms and a tabu-search method are proposed and analyzed by means of an experimental study.
Approximation algorithms for the design of SDH/SONET networks
In this paper, a graph partitioning problem that arises in the design of SONET/SDH networks is defined and formalized. Approximation algorithms with performance guarantees are presented. To solve this problem efficiently in practice, fast greedy algorithms and a tabu-search method are proposed and analyzed by means of an experimental study.
Approximation and estimation in Markov control processes under a discounted criterion
We consider a class of discrete-time Markov control processes with Borel state and action spaces, and -valued i.i.d. disturbances with unknown density Supposing possibly unbounded costs, we combine suitable density estimation methods of with approximation procedures of the optimal cost function, to show the existence of a sequence of minimizers converging to an optimal stationary policy
Approximation by finitely supported measures
We consider the problem of approximating a probability measure defined on a metric space by a measure supported on a finite number of points. More specifically we seek the asymptotic behavior of the minimal Wasserstein distance to an approximation when the number of points goes to infinity. The main result gives an equivalent when the space is a Riemannian manifold and the approximated measure is absolutely continuous and compactly supported.
Approximation by finitely supported measures
We consider the problem of approximating a probability measure defined on a metric space by a measure supported on a finite number of points. More specifically we seek the asymptotic behavior of the minimal Wasserstein distance to an approximation when the number of points goes to infinity. The main result gives an equivalent when the space is a Riemannian manifold and the approximated measure is absolutely continuous and compactly supported.
Approximation by finitely supported measures
We consider the problem of approximating a probability measure defined on a metric space by a measure supported on a finite number of points. More specifically we seek the asymptotic behavior of the minimal Wasserstein distance to an approximation when the number of points goes to infinity. The main result gives an equivalent when the space is a Riemannian manifold and the approximated measure is absolutely continuous and compactly supported.
Approximation of nonconical preference relations in multiple-criteria decision problems.
Our work field is Multiple-Criteria Decision Making Problems. We study the binary relations, not necessarily conical, that represent the decisor's preferences in the Objective or Outcome Space, we approach them by using cones and we explore under what conditions this approximation can retrieve the entire information of these binary relations.
Approximation of reliability for a large system with non-markovian repair-times
Approximation of Reliability for a large system with non-markovian repair-times
Consider a system of many components with constant failure rate and general repair rate. When all components are reliable and easily reparable, the reliability of the system can be evaluated from the probability q of failure before restoration. In [14], authors give an asymptotic approximation by monotone sequences. In the same framework, we propose, here, a bounding for q and apply it in the ageing property case.
Approximation par un processus de diffusion de files GI/GI/1 avec dépendance de l'état
Arbres binaires de recherche : propriétés combinatoires et applications
Articles ROADEF 2007
Artificial intelligence methods in diagnostics of analog systems
Aspects of Impatience in a Finite Buffer Queue
In a multi server queuing system, buffer size is often larger than the number of servers. This necessitates queuing and waiting for some customers. Customers become impatient while waiting for service. Additionally, they may also become impatient if service is not offered at the desired rate. This paper analyses a finite buffer multi server queuing system with the additional restriction that customers may balk as well as renege. Closed form expressions of a number of performance measures are presented....
Aspects of Impatience in a Finite Buffer Queue
In a multi server queuing system, buffer size is often larger than the number of servers. This necessitates queuing and waiting for some customers. Customers become impatient while waiting for service. Additionally, they may also become impatient if service is not offered at the desired rate. This paper analyses a finite buffer multi server queuing system with the additional restriction that customers may balk as well as renege. Closed form expressions...
Assembly Line Balancing With Smoothed Work Station Assignments
Assessment of landslide susceptibility by decision trees in the metropolitan area of Istanbul, Turkey.