Skip to content

{ Monthly Archives } September 2010

The End of the INFORMS Practice Conference …

and the start of the INFORMS Conference on Business Analytics and Operations Research. The INFORMS Practice Conference has long been one of my favorite conferences.  In addition to the inspirational Edelman Competition presentations, the organizers do a great job of identifying presenters for a range of industries, illustrating the wide applicability of operations research.  The […]

Exciting Times for the INFORMS Meeting

Lots of great things are being planned for the upcoming INFORMS Meeting. Let me highlight two. First, there is a wonderful series of panel discussions planned (if I say so myself:  I organized this particular track).  The idea is to explore issues of professional interest (rather than technical tracks, which are interesting in their own […]

INFORMS Optimization Awards

The INFORMS Optimization Society just announced their 2010 awards. I [Nick Sahinidis, President of the Society] am delighted to announce the winners of the 2010 INFORMS Optimization Society Prizes: – George L. Nemhauser, winner of the first Khachiyan Prize for his life-time achievements in the field of optimization – Zhi-Quan (Tom) Luo, winner of the […]

A New Approach to MaxFlow?

The MIT public relations office is reporting a new result on the maximum flow problem.  It appears that work by Kelner, Madry, Christiano, Spielman and Teng (in some permutation:  not surprisingly, the MIT release stresses the MIT authors) has reduced the complexity of maxflow to (V+E)^4/3 (from (V+E)^3/2.  Details are pretty sketchy, but the approach […]

Call for Challenging MIP Problems

MIPLIB is a collection of instances of Mixed Integer Programs.  Versions of MIPLIB have been around since 1992, and these have been invaluable as we see how we have advanced in solving difficult MIP instances. Some instances that were essentially unsolvable twenty years ago can now be solved in a fraction of a second.  We […]

Definitive Word on P!=NP Paper

Lance Fortnow of the blog Computational Complexity has, I believe, the definitive word on the P!=NP paper by Deolalikar (saying in a sentence what I couldn’t quite manage in two pages): Proving P  ≠ NP will require pure genius but you shouldn’t need a Fields medalist to verify the proof. Secondary message:  a good way to […]

Reading “Numbers Rule” by Szpiro

It is Labor Day weekend here in the US, so, in addition to the mandatory grilling and bicycling with Alexander, I have some time to laze about on the porch reading books (and drinking beer, which is also legally required in my jurisdiction).  I have been reading Numbers Rule by George Szpiro.  This is a […]

The List Every University Should Want to Be On

About this time last year, I asked advice about where a high school senior should consider for college engineering.  At the back of my mind, I was figuring that this is a pretty smart kid and both of his parents have PhDs, so finding a place that might get him fired up enough to consider […]

P versus NP and the Research Process

By now, everyone in computer science and operations research is aware of the purported P<>NP proof of Vinay Deolalikar of HP Labs.  After intense discussion (mainly through blogs and wikis), the original paper was taken down, and Vinay has prepared a new version for submission.  He claims: I have fixed all the issues that were […]

Five Sundays, Mondays, and Tuesdays and Operations Research Training

A half dozen times in the past couple of weeks I have either been told, received an email, or otherwise ran across the following “fact”: August 2010 has five Sundays, Mondays, and Tuesdays, and this won’t happen again for 823 years! Wow!  That is pretty amazing. It is also completely ridiculous and false.  May, 2011, […]