Journal: Mathematics of Operations Research

Found 1103 papers in total
On Barvinok's algorithm for counting lattice points in fixed dimension
On Barvinok's algorithm for counting lattice points in fixed dimension
1997,
We describe a simplification of a recent polynomial-time algorithm of A.I. Barvinok...
Integral solutions of linear complementarity problems
Integral solutions of linear complementarity problems
1998,
We characterize the class of integral square matrices M having the property that for...
Persistency in 0–1 polynomial programming
Persistency in 0–1 polynomial programming
1998,
An optimal solution to the continuous relaxation of a mixed-integer 0–1 linear...
Maximum entropy reconstruction using derivative information, 1. Fisher information and convex duality
Maximum entropy reconstruction using derivative information, 1. Fisher information and convex duality
1996,
Maximum entropy spectral density estimation is a technique for reconstructing an...
Integer solution for linear complementarity problem
Integer solution for linear complementarity problem
1998,
We consider the problem of finding an integer solution to a linear complementarity...
A simplicial approach to the determination of an integer point of a simplex
A simplicial approach to the determination of an integer point of a simplex
1998,
We propose an algorithm to find an integer point of a simplex. The algorithm is based...
Combining problem structure with basis reduction to solve a class of hard integer programs
Combining problem structure with basis reduction to solve a class of hard integer programs
2002,
Recently Aardal et al . have successfully solved some small, difficult,...
On ws-convergence of product measures
On ws-convergence of product measures
2001,
A number of fundamental results, centered around extensions of Prohorov's theorem, is...
The complexity of generic primal algorithms for solving general integer programs
The complexity of generic primal algorithms for solving general integer programs
2002,
Primal methods constitute a common approach to solving (combinatorial) optimization...
A polyhedral study of integer variable upper bounds
A polyhedral study of integer variable upper bounds
2002,
We study the polyhedron of the single node capacitated network design model with...
The zero duality gap property and lower semicontinuity of the perturbation function
The zero duality gap property and lower semicontinuity of the perturbation function
2002,
We examine the validity of the zero duality gap properties for two important dual...
On the convergence of the iteration sequence of infeasible path following algorithms for linear complementarity problems
On the convergence of the iteration sequence of infeasible path following algorithms for linear complementarity problems
1997,
A generalized class of infeasible-interior-point methods for solving horizontal linear...
On a wide region of centers and primal–dual interior point algorithms for linear programming
On a wide region of centers and primal–dual interior point algorithms for linear programming
1997,
In the adaptive step primal–dual interior point method for linear programming,...
Colourful linear programming and its relatives
Colourful linear programming and its relatives
1997,
We consider the following Colourful generalization of Linear Programming: given sets...
Estimation of derivatives of nonsmooth performance measures in regenerative systems
Estimation of derivatives of nonsmooth performance measures in regenerative systems
2001,
We investigate the problem of estimating derivatives of expected steady-state...
On the complexity of solving sparse symmetric linear programs specified with approximate data
On the complexity of solving sparse symmetric linear programs specified with approximate data
1997,
An algorithm that solves symmetric linear programs specified with approximate data is...
Centers of monotone generalized complementarity problems
Centers of monotone generalized complementarity problems
1997,
Let C be a full dimensional, closed, pointed and convex cone in a finite dimensional...
Multi-parameter surfaces of analytic centers and long-step surface-following interior point methods
Multi-parameter surfaces of analytic centers and long-step surface-following interior point methods
1998,
We develop a long-step polynomial time version of the Method of Analytic Centers for...
On two interior-point mappings for nonlinear semidefinite complementarity problems
On two interior-point mappings for nonlinear semidefinite complementarity problems
1998,
Extending our previous work, this paper studies properties of two fundamental mappings...
Shadow prices in infinite-dimensional linear programming
Shadow prices in infinite-dimensional linear programming
1998,
We consider the class of linear programs that can be formulated with infinitely many...
Stability in the discretization of a parametric semi-infinite convex inequality system
Stability in the discretization of a parametric semi-infinite convex inequality system
2002,
In this paper, we consider a parametric family of convex inequality systems in the...
Overlapping generations games with mixed strategies
Overlapping generations games with mixed strategies
1996,
This paper proves a Folk Theorem for overlapping generations games in the case where...
Semismooth Karush–Kuhn–Tucker equations and convergence analysis of Newton and quasi-Newton methods for solving these equations
Semismooth Karush–Kuhn–Tucker equations and convergence analysis of Newton and quasi-Newton methods for solving these equations
1997,
There are several forms of systems of nonsmooth equations which are equivalent to the...
Asymptotically efficient adaptive strategies in repeated games. (2). Asymptotic optimality
Asymptotically efficient adaptive strategies in repeated games. (2). Asymptotic optimality
1996,
This paper continues the analysis of a dynamic decision problem modeled as a...
Papers per page: