Country: United States

Found 17049 papers in total
Rates of convergence of stochastically monotone and continuous time Markov models
Rates of convergence of stochastically monotone and continuous time Markov models
2000,
In this paper we give bounds on the total variation distance from convergence of a...
Stability of degenerate diffusions with state-dependent switching
Stability of degenerate diffusions with state-dependent switching
1999,
This paper deals with the ergodic properties of hybrid systems modelled by diffusion...
Enhanced model representations for an intra-ring synchronous optical network design problem allowing demand splitting
Enhanced model representations for an intra-ring synchronous optical network design problem allowing demand splitting
2000,
In this paper, we consider a network design problem arising in the context of...
A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs
A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs
1994,
We give a linear time and space algorithm for analyzing trees in planar graphs. The...
Stability analysis for the shortest path problems
Stability analysis for the shortest path problems
1999,
The shortest path (SP) problem is to find the shortest (e.g. least cost) path from the...
A simplex-based tabu search method for capacitated network design
A simplex-based tabu search method for capacitated network design
2000,
The fixed charge capacitated multicommodity network design problem is a well-known...
On the numerical solutions of stochastic optimization problem
On the numerical solutions of stochastic optimization problem
1997,
In this paper we discuss the role of soft computing (SC) in optimization problems. We...
Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment
Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment
2000,
A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for...
An ant colony system hybridized with a new local search for the sequential ordering problem
An ant colony system hybridized with a new local search for the sequential ordering problem
2000,
We present a new local optimizer called SOP-3-exchange for the sequential ordering...
A parallel shortest augmenting path algorithm for the assignment problem
A parallel shortest augmenting path algorithm for the assignment problem
1991,
A parallel version of the shortest augmenting path algorithm for the assignment...
Solving graph bisection problems with semidefinite programming
Solving graph bisection problems with semidefinite programming
2000,
An exact solution method for the graph bisection problem is presented. We describe a...
On the rank-based selection strategy for the group interview problem
On the rank-based selection strategy for the group interview problem
1996,
For the so-called group interview problem in which several groups of choice...
Market split and basis reduction: Towards a solution of the Cornuejols–Dawande instances
Market split and basis reduction: Towards a solution of the Cornuejols–Dawande instances
2000,
Cornuejols and Dawande proposed a set of 0–1 linear programming instances that...
Output-sensitive results on convex hulls, extreme points, and related problems
Output-sensitive results on convex hulls, extreme points, and related problems
1996,
We use known data structures for ray-shooting and linear-programming queries to derive...
Practical piecewise-linear approximation for monotropic optimization
Practical piecewise-linear approximation for monotropic optimization
2000,
Piece-wise linear programs are routinely used in applications to approximate nonlinear...
Las Vegas algorithms for linear and integer programming when the dimension is small
Las Vegas algorithms for linear and integer programming when the dimension is small
1995,
This paper gives an algorithm for solving linear programming problems. For a problem...
On duality in semi-infinite programming and existence theorems for linear inequalities
On duality in semi-infinite programming and existence theorems for linear inequalities
1999,
Linear semi-infinite programming deals with the optimization of linear functionals on...
Affine geometric method for linear programs
Affine geometric method for linear programs
1997,
The algebraic (simplex) method is a complete enumerating algorithm to solve bounded...
Initialization of the simplex algorithm: An artificial-free approach
Initialization of the simplex algorithm: An artificial-free approach
1997,
The simplex algorithm requires artificial variables for solving linear programs which...
Sensitivity analysis in parametrized convex vector optimization
Sensitivity analysis in parametrized convex vector optimization
1996,
This paper provides some results concerning sensitivity analysis in parametrized...
Optimality conditions for vector mathematical programming via a theorem of the alternative
Optimality conditions for vector mathematical programming via a theorem of the alternative
1999,
This paper is concerned with the optimality conditions for nonsmooth and nonconvex...
Minimal representation of convex regions defined by analytic functions
Minimal representation of convex regions defined by analytic functions
2000,
In this paper we are concerned with characterizing minimal representation of feasible...
Sensitivity analysis for convex multiobjective programming in abstract spaces
Sensitivity analysis for convex multiobjective programming in abstract spaces
1996,
The main object of this paper is to prove that for a linear or convex multiobjective...
A geometric view of parametric linear programming
A geometric view of parametric linear programming
1992,
We present a new definition of optimality intervals for the parametric right-hand side...
Papers per page: