The developerWorks Connections platform will be sunset on December 31, 2019. On January 1, 2020, this blog will no longer be available. More details available on our FAQ.
Data Science Is Hard : A Look At Sotchi Olympics
Data Science is hard. I'll use an example that made lots of buzz to show some of the issues with data science. Two brothers, Dan and Tim Graettinger, who work for Discovery Corps, Inc. devised a predictive model that predicts medal count per country for the Sotchi Olympics. The Graettinger brothers model was commented on most data science and analytics sites, in OR blogs (see Laura McLay's entry) , even beyond . Question is: did they predict medal count correctly? Before answering that question let me flush... [More]
Tags: analytics data_science 
Solving the hardest Sudoku  part 2
My previous post on Sudoku described how a fairly simple OPL model could be used to solve a hard Sudoku problem. I ended the post this way: What? What do you say? I see, you're asking about the solution to the above Sudoku. Well, why not download CPLEX for free and run the above model to find out? This post is a detailed tutorial on how to run that Sudoku model on a Windows PC using CPLEX. It also addresses an interesting challenge about using Microsoft Excel for defining the problem data and for publishing the... [More]

Solving the hardest Sudoku  part 1
Do you know the hardest Sudoku problem? Do you know the best way to solve it? Before answering these questions, let me remind you of what the Sudoku puzzle is about in case you haven't read a newspaper in the last decade (adapted from wikipedia ): The objective is to fill a 9×9 grid with digits so that the digits in each column, each row, and each of the nine 3×3 subgrids that compose the grid (also called ""blocks") are pairwise different. The puzzle setter provides a partially completed grid, which... [More]
Tags: sudoku mathematical_optimization analytics optimization mathematics constraint_programming 
Tower of Hanoi at Large
Did you know that the Tower of Hanoi puzzle had real world applications? I was lucky enough to be involved with one such application . Before describing the application, let me recap briefly what the puzzle is about. I'll borrow the definition from wikipedia . The Tower of Hanoi (also called the Tower of Brahma or Lucas' Tower , [ 1 ] and sometimes pluralised) is a mathematical game or puzzle . It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks... [More]
Tags: smarter_city analytics constraint_programming optimization 
Centers of Polygons in OPL
Ryan J. O'Neil has written an interesting post on centers of polygons . Reason I'm blogging here is that he also asks an interesting question for the case where the polygon is a rectangle. Before looking at rectangles, let's define the general problem. There are several definitions of the center of polygons, and we'll use the one used by Ryan: it is the center of the largest circle contained by the polygon. It is called the Chebyshev center of the polygon. Here is an example used by Ryan.... [More]
Tags: mathematical_optimization mathematics analytics optimization 
Constraint Programming History
Paul Shaw and I were invited by John Poppelaars to give talks at the Back to School seminar of Dutch ORMS society. Part of our presentation was a brief history of constraint programming. We drafted this slide to summarize it. We certainly left out many important topics and CP systems, and we welcome any suggestions to improve it. You can use comments to this post for suggested changes and additions. Before commenting about what we missed, please have a look at the full presentation as it will provide some context. Its... [More]
Tags: analytics optimization 
2013
To all my readers, I hope you enjoyed reading this blog as much as I enjoyed writing it. I want to thank you all as you are the reason for the existence of the blog. You'll find below a quick recap of the blog activity for 2013. I wish all of you a happy and fruitful 2014! My blog got about 130,000 page views (not counting the home page) during 2013, with 31 new posts. It is a significant increase compared to the 31,000 pages views in 2012. The number of views increased significantly very late in the year with the... [More]
Tags: analytics cplex optimization 
No, The TSP Isn't NP Complete
Two recent blog posts discussing the Traveling Saleman Problem (TSP) led me to write this post. The two blog posts are What is Operations Research by Graham Kendall, and I’ve Been Everywhere (Optimally…) by Rob Jefferson. Both are worth reading (I wish I had written them..). These posts share two interesting properties: both discuss the TSP, and both make a slight mistake about the TSP. The same mistake occurs regularly in blog posts and even books. The mistake is... [More]
Tags: np analytics optimization 
Free CPLEX Software For Academics 
Solving Flexible Job Shop Scheduling Problems
A recent post by Quintq team about solving hard scheduling problems made me wonder how our Constraint Programming Optimizer (CP Optimizer) would perform on the same problems. I therefore contacted Philippe Laborie who is working on CP Optimizer. He worked with another colleague, Petr Vilim, and quickly produced quite interesting results using our forthcoming version 12.6 of CP Optimizer . Here is how Philippe and Petr describe what they did. JeanFrançois Puget This benchmark is known as Flexible Job Shop... [More]
Tags: constraint_programming benchmark 