Journal: Mathematics of Operations Research

Found 1103 papers in total
On the throughput of a resource sharing model
On the throughput of a resource sharing model
2001,
A stochastic model of a parallel system with synchronization constraints is analyzed...
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...
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...
Global methods for nonlinear complementarity problems
Global methods for nonlinear complementarity problems
1996,
Global methods for nonlinear complementarity problems formulate the problem as a...
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...
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...
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...
Risk, ambiguity, and the separation of utility and beliefs
Risk, ambiguity, and the separation of utility and beliefs
2001,
We introduce a general model of static choice under uncertainty, arguably the weakest...
Convergence analysis of stochastic algorithms
Convergence analysis of stochastic algorithms
1996,
This paper investigates asymptotic convergence to stationary points of gradient...
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...
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...
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...
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...
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...
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...
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...
Separating clique trees and bipartition inequalities having a fixed number of handles and teeth in polynomial time
Separating clique trees and bipartition inequalities having a fixed number of handles and teeth in polynomial time
1997,
Many important cutting planes have been discovered for the traveling salesman problem....
Continuous characterizations of the maximum clique problem
Continuous characterizations of the maximum clique problem
1997,
Given a graph G whose adjacency matrix is A , the Motzkin–Strauss formulation of...
A generalization of the perfect graph theorem under the disjunctive index
A generalization of the perfect graph theorem under the disjunctive index
2002,
In this paper, we relate antiblocker duality between polyhedra, graph theory, and the...
A note on clique-web facets for multicut polytopes
A note on clique-web facets for multicut polytopes
2002,
In this note we provide a previously undiscovered necessary condition for the...
A fixed-point approach to stable matchings and some applications
A fixed-point approach to stable matchings and some applications
2003,
We describe a fixed-point based approach to the theory of bipartite stable matchings....
A near-optimal solution to a two-dimensional cutting stock problem
A near-optimal solution to a two-dimensional cutting stock problem
2000,
We present an asymptotic fully polynomial approximation scheme for strip-packing, or...
The computation of a continuum of constrained equilbria
The computation of a continuum of constrained equilbria
1996,
The equilibria of a model of an exchange economy with price rigidities are called...
Optimal adaptive policies for Markov decision processes
Optimal adaptive policies for Markov decision processes
1997,
In this paper we consider the problem of adaptive control for Markov Decision...
Papers per page: