Skip to content
Surf Wiki
Save to docs
science/mathematics

From Surf Wiki (app.surf) — the open knowledge base

Mathematics of Operations Research


FieldValue
titleMathematics of Operations Research
abbreviationMath. Oper. Res.
editorKatya Scheinberg
disciplineMathematics
publisherInstitute for Operations Research and the Management Sciences
frequencyQuarterly
historyFeb. 1976-present
impact1.9
impact-year2024
websitehttps://pubsonline.informs.org/journal/moor
OCLC692909490
LCCN76647217
CODENMOREDQ
ISSN0364-765X
eISSN1526-5471

| impact-year = 2024 Mathematics of Operations Research is a quarterly peer-reviewed scientific journal established in February 1976. It focuses on areas of mathematics relevant to the field of operations research such as continuous optimization, discrete optimization, game theory, machine learning, simulation methodology, and stochastic models. The journal is published by INFORMS (Institute for Operations Research and the Management Sciences). the journal has a 2024 impact factor of 1.9. {{cite web |author= |date=|title= Mathematics of Operations Research|url= https://pubsonline.informs.org/journal/moor

History

The journal was established in 1976. The founding editor-in-chief was Arthur F. Veinott Jr. (Stanford University). He served until 1980, when the position was taken over by Stephen M. Robinson, who held the position until 1986. Erhan Cinlar served from 1987 to 1992, and was followed by Jan Karel Lenstra (1993-1998). Next was Gérard Cornuéjols (1999-2003) and Nimrod Megiddo (2004-2009). Finally came Uri Rothblum (2009-2012), Jim Dai (2012-2018), and the current editor-in-chief Katya Scheinberg (2019–present).

The journal's three initial sections were game theory, stochastic systems, and mathematical programming. Currently, the journal has four sections: continuous optimization, discrete optimization, stochastic models, and game theory.

Notable papers

The following papers have been cited most frequently:

  1. Roger B. Myerson, "Optimal Auction Design", vol 6:1, 58-73
  2. A. Ben-Tal and Arkadi Nemirovski, "Robust Convex Optimization", vol 23:4, 769-805
  3. M. R. Garey, D. S. Johnson, and Ravi Sethi, "The Complexity of Flowshop and Jobshop Scheduling", vol 1:2, 117-129

References

Info: Wikipedia Source

This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.

Want to explore this topic further?

Ask Mako anything about Mathematics of Operations Research — get instant answers, deeper analysis, and related topics.

Research with Mako

Free with your Surf account

Content sourced from Wikipedia, available under CC BY-SA 4.0.

This content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.

Report