This post discusses some challenges associated with testing a solver based on local search heuristics. Local search is quite different from mathematical programming-based solvers and it should be tested accordingly. The associated primal post (not yet published) presents the results of my experiments with LocalSolver 3.0. Local Search VS MI(N)LP: Apples and Oranges First thing […]
Archives for June 2013
We academia enjoy giving advice to others. Here are a few reasons why solver developers should sometimes listen to what academia have to say. You can get a set of opposite arguments on the associated dual post.
This post announces a new series of posts that I have been preparing over the last few months. Each set will consist of a pair of posts -the primal and the dual – that will look at a given topic from two different points of view. Posts will usually be published on consecutive days.
This post records my observations and comments after my first evening using LocalSolver, a solver based on the local search paradigm rather than on the branch-and-cut framework common to most MIP solvers. Overall, my first contact with LocalSolver was quite positive. This is a very general review, as its performance and features will be reviewed in […]
Today’s post is a personal story. Most researchers – either professionals or academic – are accustomed to be successful and to be among the best. When I started doing research, I discovered a new world in which my previous experience didn’t count much. And in order to become a better researcher, I had to get […]