September 17 to 20, 2012  ::  Angra dos Reis, Rio de Janeiro, Brazil

The Matheuristics workshop series is proposed as a primary forum for researchers working on exploiting mathematical programming techniques in a (meta)heuristic framework, granting to mathematical programming approaches the problem robustness and time effectiveness which characterize metaheuristics, or exploiting the mathematical programming model formulation in the customization of a metaheuristic for specific or general problems.

The Matheuristics’2012 workshop will be held at Portogalo Suite Hotel, located in Angra dos Reis, Brazil, from September 17 to 20, 2012.

Metaheuristic algorithms and frameworks, such as tabu search, simulated annealing, GRASP, VNS, genetic algorithms and ant colonies, have been originally proposed and developed when the available Mixed Integer Programming (MIP) algorithms and software were not an efficient or even feasible alternative 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 MIP codes can be effective even in a heuristic context, both as primary solvers or as subprocedures.

Matheuristics’2012 aims at collecting contributions that define the state of the art for the computational effectiveness and efficiency or the theoretical properties of “matheuristics”, which are algorithms and codes that integrate metaheuristics and MIP strategies and software. The workshop will be entirely devoted to this subject of research and its applications. The conference program will consist only of plenary presentations, enriched by a couple of key-note lectures. Topics of interest include (but are not limited to):

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

Although we do not discard their importance, Matheuristics’2012 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 or implementations which are not justified by a mathematical model.

All participants are encouraged to attend also CLAIO XVI – 16th Conference of the Latin-American Association of Operations Research, that will be held in Rio de Janeiro, Brazil, in the following week, from September 24 to 28.