June 16 - 18, 2008
University Residential Center
Bertinoro (Forlì-Cesena), Italy

Building on the success of the first Matheuristics meeting (August, 2006), the Matheuristics 2008 workshop is proposed as a primary forum for researchers working either on exploiting mathematical programming (MP) techniques in a (meta)heuristic framework or on granting to mathematical programming approaches the cross-problem robustness and constrained-CPU-time effectiveness which characterize metaheuristics. Discriminating landmark is some form of exploitation of the mathematical formulation of the problems of interest.

Metaheuristic algorithms and frameworks, such as tabu search, genetic algorithms, VNS, etc., were in fact usually proposed in years when Mixed Integer Programming (MIP) was seldom a viable option for solving real-world problem instances, or significant subproblems thereof. However, research on mathematical programming, and in particular on discrete optimization, has led to a state of the art where MIP solvers or customized MP codes can be effective even in a heuristic context, both as primary solvers or as subprocedures. Matheuristics 2008 will help defining the state of the art for the computational effectiveness and efficiency or theoretical properties of integrated metaheuristics/MIP codes (MH codes).

Matheuristics 2008 will be entirely dedicated to this new research option, the conference program will consist only of plenary presentations. All accepted presentations will be published in a conference proceedings volume. Grants will be available for Ph.D. students.

Topics of interest include:

  • Dual information and metaheuristics;
  • Decompositions and lower/upper bounds in MH codes;
  • Upper and lower bounds interacting evolutions;
  • Stochastic programming and heuristic search;
  • Metaheuristics for stochastic problems;
  • Model-based metaheuristics;
  • MIP solvers as search components (local branching, RINS, ...);
  • Hybridizing (meta)heuristics and exact methods;
  • Experimental analysis and modeling of algorithms;
  • Real world case histories of successful MH applications.

Matheuristics 2008 is not interested in heuristics tailored to a specific problem that have no element which can be generalized to other problems - no matter how mathematically sophisticated they are - nor in metaheuristics variants which are not justified by a mathematical model.

Download the conference call for paper in pdf