On Two-State Quality Control Under Markovian Deterioration.
On undiscounted markovian decision processes with compact action spaces
On using multistage linking constraints for stochastic optimization as a decision-making aid
We present a model1ing framework for multistage planning problems under uncertainty in the objective function coefficients and right-hand-side. A multistagy scenario analysis scheme with partial recourse is used. So, the decisíon polícy can be implemented for a given set of initial time periods (so-called implementable time stage), such that the solution for the other periods lioes not need' to be anticipated and, then, it depends upon the scenario group to occur at each stage. In any ca~e the solution...
On various criteria of optimality in probabilistic decision-making
On weighted synthesis of judgements.
On weighted synthesis of judgements. (Short Communication).
On well-posedness for parametric vector quasiequilibrium problems with moving cones
In this paper we consider weak and strong quasiequilibrium problems with moving cones in Hausdorff topological vector spaces. Sufficient conditions for well-posedness of these problems are established under relaxed continuity assumptions. All kinds of well-posedness are studied: (generalized) Hadamard well-posedness, (unique) well-posedness under perturbations. Many examples are provided to illustrate the essentialness of the imposed assumptions. As applications of the main results, sufficient conditions...
On Wellposedness Quadratic Function Minimization Problem on Intersection of Two Ellipsoids
On ƒ-wise Arc Forwarding Index and Wavelength Allocations in Faulty All-optical Hypercubes
Motivated by the wavelength division multiplexing in all-optical networks, we consider the problem of finding an optimal (with respect to the least possible number of wavelengths) set of ƒ+1 internally node disjoint dipaths connecting all pairs of distinct nodes in the binary r-dimensional hypercube, where 0 ≤ ƒ < r. This system of dipaths constitutes a routing protocol that remains functional in the presence of up to ƒ faults (of nodes and/or links). The problem of constructing such...
On ɛ-optimal strategies in discounted Markov games
One-machine scheduling with allocation of continuously-divisible resource and with no precedence constraints
One-machine sequencing with release dates, delivery times and precedence constraints
One-sided approximation of Bayes rule and its application to regression model with Cauchy noise
On-Line Computation and Maximum-Weighted Hereditary Subgraph Problems
Online LIB problems : heuristics for bin covering and lower bounds for bin packing
We consider the NP Hard problems of online Bin Covering and Packing while requiring that larger (or longer, in the one dimensional case) items be placed at the bottom of the bins, below smaller (or shorter) items — we call such a version, the LIB version of problems. Bin sizes can be uniform or variable. We look at computational studies for both the Best Fit and Harmonic Fit algorithms for uniform sized bin covering. The Best Fit heuristic for this version of the problem is introduced here. The...
Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing
We consider the NP Hard problems of online Bin Covering and Packing while requiring that larger (or longer, in the one dimensional case) items be placed at the bottom of the bins, below smaller (or shorter) items — we call such a version, the LIB version of problems. Bin sizes can be uniform or variable. We look at computational studies for both the Best Fit and Harmonic Fit algorithms for uniform sized bin covering. The Best Fit heuristic for this version of the problem is introduced here. The...
On-Line Waste Management in a Galvanization Plant
Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization.
Open shop scheduling with delays
Opérateurs positifs et probabilités stationnaires