Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
Alexander SchrijverAndrew V. GoldbergBARONFulkerson Prize

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2003
2003
New Mathematical Disciplines and Research in the Wake of World War II
This paper focuses on the significance of the Second World War for the rise and establishment of new disciplines in applied… 
1998
1998
Strongly polynomial dual simplex methods for the maximum flow problem
This paper presents dual network simplex algorithms that require at most 2nm pivots and O(n2m) time for solving a maximum flow… 
1998
1998
Max Horn SAT and the minimum cut problem in directed hypergraphs
In this paper we consider the Maximum Horn Satisfiability problem, which is reduced to the problem of finding a minimum… 
1998
1998
Cutting planes for mixed-integer knapsack polyhedra
An algorithm for generating cutting planes for mixed-integer knapsack polyhedra is described. The algorithm represents an exact… 
1998
1998
Fully copositive matrices
The class of fully copositive (C0f) matrices introduced in [G.S.R. Murthy, T. Parthasarathy, SIAM Journal on Matrix Analysis and… 
1998
1998
Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine
We consider a scheduling problem introduced by Ahmadi et al., Batching and scheduling jobs on batch and discrete processors… 
1998
1998
Scheduling uniform machines on-line requires nondecreasing speed ratios
We consider the following on-line scheduling problem. We have to schedulen independent jobs, wheren is unknown, onm uniform… 
1997
1997
On the monotonization of polyhedra
In polyhedral combinatorics one often has to analyze the facial structure of less than full dimensional polyhedra. The presence… 
1997
1997
A dual-active-set algorithm for positive semi-definite quadratic programming
Because of the many important applications of quadratic programming, fast and efficient methods for solving quadratic programming… 
1997
1997
On the degree and separability of nonconvexity and applications to optimization problems
We study qualitative indications for d.c. representations of closed sets in and functions on Hilbert spaces. The first indication… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)