Balance locale dans les réseaux à trois stations
Balanced problems on graphs with categorization of edges
Suppose a graph G = (V,E) with edge weights w(e) and edges partitioned into disjoint categories S₁,...,Sₚ is given. We consider optimization problems on G defined by a family of feasible sets (G) and the following objective function: For an arbitrary number of categories we show that the L₅-perfect matching, L₅-a-b path, L₅-spanning tree problems and L₅-Hamilton cycle (on a Halin graph) problem are NP-complete. We also summarize polynomiality results concerning above objective functions for arbitrary...
Balancing the stations of a self service “bike hire” system
This paper is motivated by operating self service transport systems that flourish nowadays. In cities where such systems have been set up with bikes, trucks travel to maintain a suitable number of bikes per station. It is natural to study a version of the C-delivery TSP defined by Chalasani and Motwani in which, unlike their definition, C is part of the input: each vertex v of a graph G=(V,E) has a certain amount xv of a commodity and wishes to have an amount equal to yv (we assume that and all quantities...
Balancing the stations of a self service “bike hire” system
This paper is motivated by operating self service transport systems that flourish nowadays. In cities where such systems have been set up with bikes, trucks travel to maintain a suitable number of bikes per station. It is natural to study a version of the C-delivery TSP defined by Chalasani and Motwani in which, unlike their definition, C is part of the input: each vertex v of a graph G=(V,E) has a certain amount xv of a commodity and wishes to have an amount equal to yv (we assume that and all quantities...
Bandwidth Allocation and Pricing Problem for a Duopoly Market
Batch scheduling on two-machine flowshop with machine-dependent setup times.
Batch scheduling problem with due-date and fuzzy precedence relation
A single-machine batch scheduling problem is investigated. Each job has a positive processing time and due-date. Setup times are assumed to be identical for all batches. All batch sizes cannot exceed a common upper bound. As in many practical situations, jobs have to be subject to flexible precedence constraints. The aim of this paper is to find an optimal batch sequence. The sequence is to minimize the maximal completion time and maximize the minimum value of desirability of the fuzzy precedence....
Bayesian estimation of the mean holding time in average semi-Markov control processes
We consider semi-Markov control models with Borel state and action spaces, possibly unbounded costs, and holding times with a generalized exponential distribution with unknown mean θ. Assuming that such a distribution does not depend on the state-action pairs, we introduce a Bayesian estimation procedure for θ, which combined with a variant of the vanishing discount factor approach yields average cost optimal policies.
Bayesian parameter estimation and adaptive control of Markov processes with time-averaged cost
This paper considers Bayesian parameter estimation and an associated adaptive control scheme for controlled Markov chains and diffusions with time-averaged cost. Asymptotic behaviour of the posterior law of the parameter given the observed trajectory is analyzed. This analysis suggests a "cost-biased" estimation scheme and associated self-tuning adaptive control. This is shown to be asymptotically optimal in the almost sure sense.
Behaviour of passage time for a queueing network model with feedback: a simulation study.
Belief functions induced by multimodal probability density functions, an application to the search and rescue problem
In this paper, we propose a new method to generate a continuous belief functions from a multimodal probability distribution function defined over a continuous domain. We generalize Smets' approach in the sense that focal elements of the resulting continuous belief function can be disjoint sets of the extended real space of dimension n. We then derive the continuous belief function from multimodal probability density functions using the least commitment principle. We illustrate the approach on two...
Belief functions induced by multimodal probability density functions, an application to the search and rescue problem
In this paper, we propose a new method to generate a continuous belief functions from a multimodal probability distribution function defined over a continuous domain. We generalize Smets' approach in the sense that focal elements of the resulting continuous belief function can be disjoint sets of the extended real space of dimension n. We then derive the continuous belief function from multimodal probability density functions using the least commitment principle. We illustrate the approach on two...
Bemerkungen zu Gomorys Algorithmus
Bemerkungen zum Verfahren der koordinatenweisen Suche
In der vorliegenden Arbeit wird das Verfahren der koordinatenweisen Suche mit Hilfe der Intervallarithmetik realisiert. Dadurch ist es möglich, bei speziellen nichtlinearen Optimierungsproblemen alle auftretenden Fehlerarten zu erfaßen, einschliesslich eingangsbedingter Fehler. Vor- und Nachteile werden erläutert sowie Testbeispiele angegeben.
Bicriterion release policy for exponential software reliability growth model
Bi-directional nearness in a network by AHP (Analytic Hierarchy Process) and ANP (Analytic Network Process)
Bi-directional nearness in a network by AHP (Analytic Hierarchy Process) and ANP (Analytic Network Process)
In this paper we study bi-directional nearness in a network based on AHP (Analytic Hierarchy Process) and ANP (Analytic Network Process). Usually we use forward (one-dimensional) direction nearness based on Euclidean distance. Even if the nearest point to i is point j, the nearest point to j is not necessarily point i. Sowe propose the concept of bi-directional nearness defined by AHP'ssynthesizing of weights “for” direction and “from” direction. This concept of distance is a relative distance...
Bilevel programs with extremal value function: global optimality.
Bilinear programming
Binary integer programming solution for troubleshooting with dependent actions
We deal with a sequencing problem that arises when there are multiple repair actions available to fix a broken man-made system and the true cause of the system failure is uncertain. The system is formally described by a probabilistic model, and it is to be repaired by a sequence of troubleshooting actions designed to identify the cause of the malfunction and fix the system. The task is to find a course of repair with minimal expected cost. We propose a binary integer programming formulation for...