On the velocity projection map for polyhedral Skorokhod problems.
On the weak robustness of fuzzy matrices
A matrix in -algebra (fuzzy matrix) is called weakly robust if is an eigenvector of only if is an eigenvector of . The weak robustness of fuzzy matrices are studied and its properties are proved. A characterization of the weak robustness of fuzzy matrices is presented and an algorithm for checking the weak robustness is described.
On the weighted Euclidean matching problem in
A partitioning algorithm for the Euclidean matching problem in is introduced and analyzed in a probabilistic model. The algorithm uses elements from the fixed dissection algorithm of Karp and Steele (1985) and the Zig-Zag algorithm of Halton and Terada (1982) for the traveling salesman problem. The algorithm runs in expected time and approximates the optimal matching in the probabilistic sense.
On the worst scenario method: Application to uncertain nonlinear differential equations with numerical examples
On Tridiagonal Linear Complementary Problems.
On Tucker's key theorem.
On two combination rules for 0-1-sequences.
On two methods for the parameter estimation problem with spatio-temporal FRAP data
FRAP (Fluorescence Recovery After Photobleaching) is a measurement technique for determination of the mobility of fluorescent molecules (presumably due to the diffusion process) within the living cells. While the experimental setup and protocol are usually fixed, the method used for the model parameter estimation, i.e. the data processing step, is not well established. In order to enhance the quantitative analysis of experimental (noisy) FRAP data, we firstly formulate the inverse problem of model...
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 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 ɛ-optimal strategies in discounted Markov games
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...
Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization.