Some optimization problems on solubility sets of separable Max-Min equations and inequalities
Some performance measures for vacation models with a batch Markovian arrival process.
Some properties of multiple parameters linear programming.
Some Properties of Transportation Manifold
Some reflections on the renewal-theory paradox in queueing theory.
Some relations between variational-like inequalities and efficient solutions of certain nonsmooth optimization problems.
Some remarks on Karmarkar's potential function.
Some remarks on quadratic programming with 0-1 variables
Some remarks on subdifferentiability of convex functions.
Some remarks on the space of differences of sublinear functions
Two properties concerning the space of differences of sublinear functions D(X) for a real Banach space X are proved. First, we show that for a real separable Banach space (X,‖·‖) there exists a countable family of seminorms such that D(X) becomes a Fréchet space. For X = ℝ^n this construction yields a norm such that D(ℝ^n) becomes a Banach space. Furthermore, we show that for a real Banach space with a smooth dual every sublinear Lipschitzian function can be expressed by the Fenchel conjugate of...
Some remarks on two degrees of asymmetry in the traveling salesman problem
Some Representation Theorems for Functions and Sets and their Application to Nonlinear Programming.
Some results in discrete mathematics and digital geometry by Professor Dragan Acketa.
Some results on Bellman equations of optimal production control in a stochastic manufacturing system.
Some scheduling problems with past sequence dependent setup times under the effects of nonlinear deterioration and time-dependent learning
This paper studies scheduling problems which include a combination of nonlinear job deterioration and a time-dependent learning effect. We use past sequence dependent (p-s-d) setup times, which is first introduced by Koulamas and Kyparisis [Eur. J. Oper. Res.187 (2008) 1045–1049]. They considered a new form of setup times which depend on all already scheduled jobs from the current batch. Job deterioration and learning co-exist in various real life scheduling settings. By the effects of learning...
Some Shannon-McMillan approximation theorems for Markov chain field on the generalized Bethe tree.
Sorting and cost analysis of reworking items in rejected lots based on non-destructive variable sampling plan.
Spanning trees of locally finite graphs
Spatially-distributed coverage optimization and control with limited-range interactions
This paper presents coordination algorithms for groups of mobile agents performing deployment and coverage tasks. As an important modeling constraint, we assume that each mobile agent has a limited sensing or communication radius. Based on the geometry of Voronoi partitions and proximity graphs, we analyze a class of aggregate objective functions and propose coverage algorithms in continuous and discrete time. These algorithms have convergence guarantees and are spatially distributed with respect...
Spatially-distributed coverage optimization and control with limited-range interactions
This paper presents coordination algorithms for groups of mobile agents performing deployment and coverage tasks. As an important modeling constraint, we assume that each mobile agent has a limited sensing or communication radius. Based on the geometry of Voronoi partitions and proximity graphs, we analyze a class of aggregate objective functions and propose coverage algorithms in continuous and discrete time. These algorithms have convergence guarantees and are spatially distributed with...