Country: United States

Found 17049 papers in total
Integrals of set-valued functions with a countable range
Integrals of set-valued functions with a countable range
1996,
Approximate versions, both of Lyapunov-type results on the compactness and convexity...
An infinite-phase quasi-birth-and-death model for the non-preemptive priority M/PH/1 queue
An infinite-phase quasi-birth-and-death model for the non-preemptive priority M/PH/1 queue
2002,
This paper considers a single server queue that handles arrivals from N classes of...
A unified queue length formula for BMAP/G/1 queue with generalized vacations
A unified queue length formula for BMAP/G/1 queue with generalized vacations
2002,
The main purpose of this article is to demonstrate a unified queue length formula for...
Tail asymptotics for the busy period in the G1/G/1 queue
Tail asymptotics for the busy period in the G1/G/1 queue
2001,
We characterise the tail behaviour of the busy period distribution in the GI/G/1 queue...
Buffer requirements and server ordering in a tandem queue with correlated service times
Buffer requirements and server ordering in a tandem queue with correlated service times
2001,
We analyze the intermediate buffer requirements in a tandem queue where service times...
Periodic orbits in a class of re-entrant manufacturing systems
Periodic orbits in a class of re-entrant manufacturing systems
2000,
Queue changes associated with each step of a manufacturing system are modeled by...
Diffusion approximations for some multiclass queueing networks with first-in-first-out service disciplines
Diffusion approximations for some multiclass queueing networks with first-in-first-out service disciplines
2000,
The diffusion approximation is proved for a class of multiclass queueing networks...
On the pathwise optimal Bernoulli routing policy for homogeneous parallel servers
On the pathwise optimal Bernoulli routing policy for homogeneous parallel servers
1996,
A long-standing conjecture on the optimal Bernoulli routing policy is proven to be...
The symmetric traveling salesman polytope revisited
The symmetric traveling salesman polytope revisited
2001,
In this paper we present a tour of the symmetric traveling salesman polytope, focusing...
A new and efficient ant-based heuristic method for solving the traveling salesman problem
A new and efficient ant-based heuristic method for solving the traveling salesman problem
2003,
In this paper, we present an efficient metaheuristic approach for solving the problem...
On polyhedral approximations of the second-order cone
On polyhedral approximations of the second-order cone
2001,
We demonstrate that a conic quadratic problem, (CQP) --> -->min --> -->x --> -->{e T...
Convergence analysis of stochastic algorithms
Convergence analysis of stochastic algorithms
1996,
This paper investigates asymptotic convergence to stationary points of gradient...
On a new homotopy continuation trajectory for nonlinear complementarity problems
On a new homotopy continuation trajectory for nonlinear complementarity problems
2001,
Most known continuation methods for P 0 complementarity problems require some...
Barrier functions in interior point methods
Barrier functions in interior point methods
1996,
We show that the universal barrier function of a convex cone introduced by Nesterov...
Properties of an interior-point mapping for mixed complementarity problems
Properties of an interior-point mapping for mixed complementarity problems
1996,
Using a unified theory of local homeomorphic maps, we establish some basic properties...
Global methods for nonlinear complementarity problems
Global methods for nonlinear complementarity problems
1996,
Global methods for nonlinear complementarity problems formulate the problem as a...
An epsilon-out-of-kilter method for monotropic programming
An epsilon-out-of-kilter method for monotropic programming
2001,
The out-of-kilter method was first proposed by Fulkerson for linear-cost network flow...
How stringent is the linear independence assumption for mathematical programs with complementarity constraints?
How stringent is the linear independence assumption for mathematical programs with complementarity constraints?
2001,
The linear independence constraint qualifications (LICQ) plays an important role in...
Constraint aggregation in infinite-dimensional spaces and applications
Constraint aggregation in infinite-dimensional spaces and applications
2001,
An aggregation technique for constraints with values in Hilbert spaces is suggested....
The vector partition problem for convex objective functions
The vector partition problem for convex objective functions
2001,
The partition problem concerns the partitioning of a given set of n vectors in d...
Bounds on the performance of a greedy algorithm for probabilities
Bounds on the performance of a greedy algorithm for probabilities
2001,
A bound on the performance of the greedy algorithm for finding the maximum of a...
A relative error tolerance for a family of generalized proximal point methods
A relative error tolerance for a family of generalized proximal point methods
2001,
We propose a new kind of inexact scheme for a family of generalized proximal point...
Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones
Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones
2001,
We present a general framework whereby analysis of interior-point algorithms for...
Simplex-like trajectories on quasi-polyhedral sets
Simplex-like trajectories on quasi-polyhedral sets
2001,
This paper presents a unified treatment of two new simplex-like methods for linear...
Papers per page: