Skip to search formSkip to main contentSkip to account menu
You are currently offline. Some features of the site may not work correctly.
Mathematical Optimization Society
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
1998
Highly Cited
1998
Shop scheduling problems are notorious for their intractability, both in theory and practice. In this paper, we construct a… Expand
Highly Cited
1998
Highly Cited
1998
Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity
In this paper we study the behavior of infeasible-interior-point-paths for solving horizontal linear complementarity problems… Expand
Highly Cited
1998
Highly Cited
1998
In this paper we consider stochastic programming problems where the objective function is given as an expected value function. We… Expand
Highly Cited
1998
Highly Cited
1998
AbstractWe describe an approximation algorithm for the independence number of a graph. If a graph onn vertices has an… Expand
Highly Cited
1998
Highly Cited
1998
We present an algorithm for the variational inequality problem on convex sets with nonempty interior. The use of Bregman… Expand
Highly Cited
1998
Highly Cited
1998
We present a new Lagrangian-based heuristic for solving large-scale set-covering problems arising from crew-scheduling at the… Expand
Review
1997
Review
1997
Given a set of entities, Cluster Analysis aims at finding subsets, called clusters, which are homogeneous and/or well separated… Expand
Highly Cited
1997
Highly Cited
1997
We compute constrained equilibria satisfying an optimality condition. Important examples include convex programming, saddle… Expand
Highly Cited
1997
Highly Cited
1997
Primal-dual pairs of semidefinite programs provide a general framework for the theory and algorithms for the trust region… Expand
1997
1997
This note establishes a new sufficient condition for the existence and uniqueness of the Alizadeh-Haeberly-Overton direction for… Expand