Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 221,894,039 papers from all fields of science
Search
Sign In
Create Free Account
Mathematical Optimization Society
Known as:
Mathematical Programming Society
, Mathematical Programming (journal)
, MOS
Expand
The Mathematical Optimization Society (MOS), known as the Mathematical Programming Society until 2010, is an international association of researchers…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
10 relations
Alexander Schrijver
Andrew V. Goldberg
BARON
Fulkerson Prize
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
1998
Highly Cited
1998
Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity
J. Stoer
,
Martin Wechs
Mathematical programming
1998
Corpus ID: 20016338
In this paper we study the behavior of infeasible-interior-point-paths for solving horizontal linear complementarity problems…
Expand
1998
1998
Max Horn SAT and the minimum cut problem in directed hypergraphs
G. Gallo
,
C. Gentile
,
D. Pretolani
,
Gabriella Rago
Mathematical programming
1998
Corpus ID: 5314670
In this paper we consider the Maximum Horn Satisfiability problem, which is reduced to the problem of finding a minimum…
Expand
1998
1998
Strongly polynomial dual simplex methods for the maximum flow problem
R. Armstrong
,
Wei Chen
,
D. Goldfarb
,
Zhiying Jin
Mathematical programming
1998
Corpus ID: 10232820
This paper presents dual network simplex algorithms that require at most 2nm pivots and O(n2m) time for solving a maximum flow…
Expand
1998
1998
Cutting planes for mixed-integer knapsack polyhedra
Xiao-Qing Yan
,
E. A. Boyd
Mathematical programming
1998
Corpus ID: 36940676
An algorithm for generating cutting planes for mixed-integer knapsack polyhedra is described. The algorithm represents an exact…
Expand
1998
1998
Scheduling uniform machines on-line requires nondecreasing speed ratios
Arjen P. A. Vestjens
Mathematical programming
1998
Corpus ID: 9827568
We consider the following on-line scheduling problem. We have to schedulen independent jobs, wheren is unknown, onm uniform…
Expand
Highly Cited
1997
Highly Cited
1997
Pseudomonotone variational inequality problems: Existence of solutions
J. Crouzeix
Mathematical programming
1997
Corpus ID: 6581658
Necessary and sufficient conditions for the set of solutions of a pseudomonotone variational inequality problem to be nonempty…
Expand
1997
1997
On the monotonization of polyhedra
E. Balas
,
M. Fischetti
Mathematical programming
1997
Corpus ID: 7046147
In polyhedral combinatorics one often has to analyze the facial structure of less than full dimensional polyhedra. The presence…
Expand
Highly Cited
1997
Highly Cited
1997
Equivalence of variational inequality problems to unconstrained minimization
Ji-Ming Peng
Mathematical programming
1997
Corpus ID: 5261170
In this paper we propose a class of merit functions for variational inequality problems (VI). Through these merit functions, the…
Expand
1997
1997
A dual-active-set algorithm for positive semi-definite quadratic programming
N. Boland
Mathematical programming
1997
Corpus ID: 19264241
Because of the many important applications of quadratic programming, fast and efficient methods for solving quadratic programming…
Expand
Review
1977
Review
1977
Design and implementation of optimization software
F. Lootsma
,
H. J. Greenberg
Mathematical programming
1977
Corpus ID: 11625515
History of mathematical programming systems.- Scope of mathematical programming software.- Anatomy of a mathematical programming…
Expand
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)
ACCEPT & CONTINUE