Country: United States

Found 17049 papers in total
On the value of some infinite matrix games
On the value of some infinite matrix games
2001,
It is shown that a zero-sum two-person noncooperative game A defined by a bounded...
On lower bounds of the second-order directional derivatives of Ben-Tal, Zowe and Chaney
On lower bounds of the second-order directional derivatives of Ben-Tal, Zowe and Chaney
1997,
Let f be a regular, locally Lipschitz real-valued function defined on an open convex...
Approximating subdifferentials by random sampling of gradients
Approximating subdifferentials by random sampling of gradients
2002,
Many interesting real functions on Euclidean space are differential almost everywhere....
Properties of the log-barrier function on degenerate nonlinear programs
Properties of the log-barrier function on degenerate nonlinear programs
2002,
We examine the sequence of local minimizers of the log-barrier function for a...
The theory of 2–regularity for mappings with Lispschitzian derivatives and its applications to optimality conditions
The theory of 2–regularity for mappings with Lispschitzian derivatives and its applications to optimality conditions
2002,
We study local structure of a nonlinear mapping near points where standard regularity...
A superlinearly convergent algorithm for the monotone nonlinear complementarity problem without uniqueness and nondegeneracy conditions
A superlinearly convergent algorithm for the monotone nonlinear complementarity problem without uniqueness and nondegeneracy conditions
2002,
The purpose of this paper is to present an algorithm for solving the monotone...
On the Glivenko–Cantelli problem in stochastic programming: Linear recourse and extensions
On the Glivenko–Cantelli problem in stochastic programming: Linear recourse and extensions
1998,
Integrals of optimal values of random optimization problems depending on a finite...
Quantitative stability in stochastic programming: The method of probability metrics
Quantitative stability in stochastic programming: The method of probability metrics
2002,
Quantitative stability of optimal values and solution sets to stochastic programming...
The distribution of values in the quadratic assignment problem
The distribution of values in the quadratic assignment problem
2003,
We obtain a number of results regarding the distribution of values of a quadratic...
The stable allocation (or ordinal transportation) problem
The stable allocation (or ordinal transportation) problem
2002,
The stable allocation problem generalized the 0,1 stable matching problems...
Sharp results on convergence rates for the distribution of GI/M/1/K queues as K tends to infinity
Sharp results on convergence rates for the distribution of GI/M/1/K queues as K tends to infinity
2000,
In this paper, we investigate how fast the stationary distribution π (K) of an...
Empirical testing of the infinite source Poisson data traffic model
Empirical testing of the infinite source Poisson data traffic model
2003,
The infinite source Poisson model is a fluid queue approximation of network data...
On the dynamics and performance of stochastic fluid systems
On the dynamics and performance of stochastic fluid systems
2000,
A (generalized) stochastic fluid system Q is defined as the one-dimensional Skorokhod...
A stochastic lower bound for assemble–transfer batch service queueing networks
A stochastic lower bound for assemble–transfer batch service queueing networks
2000,
Miyazawa and Taylor introduced a class of assemble–transfer batch service...
Assessing an intuitive condition for stability under a range of traffic conditions via a generalised Lu–Kumar network
Assessing an intuitive condition for stability under a range of traffic conditions via a generalised Lu–Kumar network
2000,
We argue the importance both of developing simple sufficient conditions for the...
Smoothing effect of the superposition of homogeneous sources in tandem networks
Smoothing effect of the superposition of homogeneous sources in tandem networks
2000,
We analyze the smoothing effect of superposing homogeneous sources in a network. We...
A note on the rate of convergence to equilibrium for Erlang's model in the subcritical case
A note on the rate of convergence to equilibrium for Erlang's model in the subcritical case
2000,
We derive some asymptotic results for the rate of convergence to equilibrium for the...
On the dependence structure and bounds of correlated parallel queues and their applications to synchronized stochastic systems
On the dependence structure and bounds of correlated parallel queues and their applications to synchronized stochastic systems
2000,
The paper studies the dependence structure and bounds of several basic prototypical...
A closed form solution for the asymmetric random polling system with corrected Levy input process
A closed form solution for the asymmetric random polling system with corrected Levy input process
1997,
We introduce a simple approach for modeling and analyzing the random polling system...
Stability of multiclass queueing networks under first-in-first-out service discipline
Stability of multiclass queueing networks under first-in-first-out service discipline
1997,
In this paper, we first formally identify a first-in first-out (FIFO) fluid network...
The delay of open Markovian queueing networks: Uniform functional bounds, heavy traffic pole multiplicities, and stability
The delay of open Markovian queueing networks: Uniform functional bounds, heavy traffic pole multiplicities, and stability
1997,
For open Markovian queueing networks, we study the functional dependence of the mean...
Approximating extreme points of infinite dimensional convex sets
Approximating extreme points of infinite dimensional convex sets
1998,
The property that an optimal solution to the problem of minimizing a continuous...
Integral polyhedra related to even-cycle and even-cut matroids
Integral polyhedra related to even-cycle and even-cut matroids
2002,
A family of sets ℋ is ideal if the polyhedron {x ≥ 0 : Σ i∈S x i...
A separation algorithm for b-matching degree-sequence polyhedra
A separation algorithm for b-matching degree-sequence polyhedra
2003,
A b -matching of a graph is an assignment of non-negative integers to edges such that...
Papers per page: