Tag Info

Accepted

Classics in Operations Research from around WW II?

A few suggestions. First, the series by Charles R. Shrader from the US Army Center of Military History. [1] History of Operations Research in the United States Army, Volume 1: 1942–1962. (full ...
• 1,806

Classics in Operations Research from around WW II?

I love this historic piece by Alexander Schrijver about max flow and min cut (DOI link).
• 5,779

Classics in Operations Research from around WW II?

THE classic book on WW II Operations Research is "Methods of Operations Research" by Philip M. Morse, George E. Kimball. It is basically WW II O.R., less classified material. The Dover Press version ...
• 10.6k

Breakthroughs in Operations Research since 2010

Hedetniemi conjectured in 1966 that $χ(G×H)=\min\{χ(G),χ(H)\}$ for all graphs $G$ and $H$. Here $G×H$ is the graph with vertex set $V(G)×V(H)$ defined by putting $(x,y)$ and $(x',y')$ adjacent if and ...
• 10.1k

Breakthroughs in Operations Research since 2010

Machine Learning Under a Modern Optimization Lens by Dimitris Bertsimas and Jack Dunn, is a fascinating book in the space of OR & ML. The book provides an original treatment of machine learning (...
• 181

Breakthroughs in Operations Research since 2010

In terms of the metric TSP, Karlin et al. (2020)1 developed a novel approximation algorithm that beat the infamous Christofides algorithm by a very modest difference of $10^{-36}$! This was a long ...
• 5,010

Classics in Operations Research from around WW II?

About the "submarine hunting", if "ANTISUBMARINE WARFARE IN WORLD WAR II" is not the link you had in mind, it still might be useful. Also, I found some of the links in "History of OR", the example ...
• 5,641

Is there a book about the history of linear programming?

I suggest having a look at the following book: Grötschel, M. (Ed.). (2012). Optimization stories. Dt. Mathematiker-Vereinigung. The book has a number of chapters and in particular a chapter titled &...
• 2,110
Accepted

MINTO has not been updated in many years. It was innovative in its day, but most of its ideas like fractional cuts and presolve were incorporated years ago into commercial MILP solvers like CPLEX and ...

Breakthroughs in Operations Research since 2010

INFORMS recongnizes the best contributions in OR/MS with the Frederick W. Lanchester prize, that is: "The Lanchester prize is awarded for the best contribution to operations research and the ...
• 2,034

Classics in Operations Research from around WW II?

Not a written document, but maybe interesting: an episode of the INFORMS podcast, Looking Back at the Origins of O.R. on "the first time the term Operations Research was employed, and some of the ...
• 2,665
Accepted

Interplay of OR and Statistics Research

I'm going to interpret "in OR" as appearing in OR journals and/or written by people who identify as OR/MS/IE researchers. I'm a bit familiar with the intersection of optimization and ...
• 28.9k

Classics in Operations Research from around WW II?

I really like this excerpt from Philip Morse's biography: https://pubsonline.informs.org/doi/abs/10.1287/opre.34.1.10 He doesn't go deep into methods, but he does discuss OR in WWII, including ...
• 61

Breakthroughs in Operations Research since 2010

Quadratization without auxiliary variables For decades, people have been converting arbitrary optimization problems into linear ones, which makes them far easier to solve. With so much recent progress ...
• 1,246

The First Ever Linear Programming Problems

The Linear Programming and the Simplex Method were invented by Dantzig during October 1948 to June 1952 when he was the chief mathematician of Project SCOOP (Scientific Computation of Optimal Programs)...
• 396
Accepted

Why is the Bellman-Ford's shortest path algorithm sometimes called Bellman-Kalaba?

Interesting historical question. In Section 8.7, Chapter 8 of Algorithms (2019)1, Erickson notes that The simplest implementation of Ford’s generic shortest-path algorithm was first sketched by ...
• 5,010
"A counterexample to Hirsch Conjecture" by Francisco Santos. Warren Hirsch conjectured in 1957 that the graph of a $d$-dimensional polytope with $n$ facets cannot have diameter greater than \$...