Journal: Mathematics of Operations Research

Found 1103 papers in total
An integral inequality for convex-functions, with application to teletraffic congestion problems
An integral inequality for convex-functions, with application to teletraffic congestion problems
1995,
An integral inequality for convex functions is deduced from Jensen's inequality. This...
A randomized algorithm to optimize over certain convex-sets
A randomized algorithm to optimize over certain convex-sets
1995,
This paper presents a randomized polynomial time algorithm to nearly minimize a linear...
On convergence of an augmented Lagrangian decomposition method for sparse convex-optimization
On convergence of an augmented Lagrangian decomposition method for sparse convex-optimization
1995,
A decomposition method for large-scale convex optimization problems with block-angular...
On a Newton type iterative method for solving inclusions
On a Newton type iterative method for solving inclusions
1995,
We introduce a notion of strict differentiability for multifunctions by means of a...
Fast approximation algorithms for fractional packing and covering problems
Fast approximation algorithms for fractional packing and covering problems
1995,
This paper presents fast algorithms that find approximate solutions for a general...
Minimizing maximum promptness and maximum lateness on a single machine
Minimizing maximum promptness and maximum lateness on a single machine
1996,
We consider the following single-machine bicriteria scheduling problem. A set of n...
Stability and instability of fluid models for reentrant lines
Stability and instability of fluid models for reentrant lines
1996,
Reentrant lines can be used to model complex manufacturing systems such as wafer...
On the von Neumann economic growth problem
On the von Neumann economic growth problem
1995,
We study the complexity of the von Neumann economic growth problem:...
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...
A further extension of the Knaster–Kuratowski–Mazurkiwicz–Shapley theorem
A further extension of the Knaster–Kuratowski–Mazurkiwicz–Shapley theorem
2000,
Reny and Wooders showed that there is some point in the intersection of sets in...
On homogeneous convex cones, the caratheodory number, and the duality mapping
On homogeneous convex cones, the caratheodory number, and the duality mapping
2001,
Using three simple examples, we answer three questions related to homogeneous convex...
Complexity analysis of successive convex relaxation methods for nonconvex sets
Complexity analysis of successive convex relaxation methods for nonconvex sets
2001,
This paper discusses computational complexity of conceptual successive convex...
Stochastic comparison of random vectors with a common copula
Stochastic comparison of random vectors with a common copula
2001,
We consider two random vectors X and Y, such that the components of X are dominated in...
Compatible measures and merging
Compatible measures and merging
1996,
Two measures, μ and &mutilde;, are updated as more information arrives. If with...
Shapley–Shubik and Banzhaf indices revisited
Shapley–Shubik and Banzhaf indices revisited
2001,
We provide a new axiomatization of the Shapley–Shubik and the Banzhaf power...
Quitting games
Quitting games
2001,
Quitting games are n -player sequential games in which, at any stage, each player has...
Absorbing games with a signalling structure
Absorbing games with a signalling structure
2001,
We consider a subclass of two-person zero-sum undiscounted stochastic games called...
The reflection map with discontinuities
The reflection map with discontinuities
2001,
We study the multidimensional reflection map on the spaces D([0, T], ℝ...
Correlated equilibrium in quitting games
Correlated equilibrium in quitting games
2001,
A quitting game is a sequential game where each player has two actions: to continue or...
An exact bound on epsilon for nonemptiness of epsilon cores of games
An exact bound on epsilon for nonemptiness of epsilon cores of games
2001,
We consider collections of games with and without side payments described by certain...
Learning sets in state dependent signalling game forms: A characterization
Learning sets in state dependent signalling game forms: A characterization
2001,
We consider repeated game forms with incomplete information and state dependent...
Calculating K-connectedness reliability using Steiner bounds
Calculating K-connectedness reliability using Steiner bounds
1996,
The K -connectedness reliability problem considered in this paper has as input...
Almost perfect matrices and graphs
Almost perfect matrices and graphs
2001,
We introduce the notions of ω-projection and κ-projection that map almost...
Lipschitzian multifunctions and a Lipschitzian inverse mapping theorem
Lipschitzian multifunctions and a Lipschitzian inverse mapping theorem
2001,
We introduce a new class of multifunctions whose graphs under certain ‘kernel...
Papers per page: