Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Mathematical Optimization Society

Known as: Mathematical Programming Society, Mathematical Programming (journal), MOS 
The Mathematical Optimization Society (MOS), known as the Mathematical Programming Society until 2010, is an international association of researchers… Expand
Wikipedia

Related topics

Related topics

10 relations
Alexander SchrijverAndrew V. GoldbergBARONFulkerson Prize
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
1998
Highly Cited
1998
Approximability of flow shop scheduling
  • L. Hall
  • Math. Program.
  • 1998
    • Corpus ID: 9155090
Shop scheduling problems are notorious for their intractability, both in theory and practice. In this paper, we construct a… Expand
Is this relevant?
Highly Cited
1998
Highly Cited
1998
A Lagrangian-based heuristic for large-scale set covering problems
We present a new Lagrangian-based heuristic for solving large-scale set-covering problems arising from crew-scheduling at the… Expand
Is this relevant?
Highly Cited
1998
Highly Cited
1998
A simulation-based approach to two-stage stochastic programming with recourse
In this paper we consider stochastic programming problems where the objective function is given as an expected value function. We… Expand
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Approximating the independence number via theϑ-function
AbstractWe describe an approximation algorithm for the independence number of a graph. If a graph onn vertices has an… Expand
Is this relevant?
Highly Cited
1998
Highly Cited
1998
An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
We present an algorithm for the variational inequality problem on convex sets with nonempty interior. The use of Bregman… Expand
Is this relevant?
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
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Approximate iterations in Bregman-function-based proximal algorithms
This paper establishes convergence of generalized Bregman-function-based proximal point algorithms when the iterates are computed… Expand
  • figure 1
Is this relevant?
Highly Cited
1997
Highly Cited
1997
A semidefinite framework for trust region subproblems with applications to large scale minimization
Primal-dual pairs of semidefinite programs provide a general framework for the theory and algorithms for the trust region… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Equilibrium programming using proximal-like algorithms
We compute constrained equilibria satisfying an optimality condition. Important examples include convex programming, saddle… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Free material optimization via mathematical programming
This paper deals with a central question of structural optimization which is formulated as the problem of finding the stiffest… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE