<html xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:w="urn:schemas-microsoft-com:office:word" xmlns:m="http://schemas.microsoft.com/office/2004/12/omml" xmlns="http://www.w3.org/TR/REC-html40">
<head>
<meta http-equiv=Content-Type content="text/html; charset=iso-8859-1">
<meta name=Generator content="Microsoft Word 12 (filtered medium)">
<style>
<!--
/* Font Definitions */
@font-face
{font-family:"Cambria Math";
panose-1:2 4 5 3 5 4 6 3 2 4;}
@font-face
{font-family:Calibri;
panose-1:2 15 5 2 2 2 4 3 2 4;}
/* Style Definitions */
p.MsoNormal, li.MsoNormal, div.MsoNormal
{margin:0cm;
margin-bottom:.0001pt;
font-size:11.0pt;
font-family:"Calibri","sans-serif";}
a:link, span.MsoHyperlink
{mso-style-priority:99;
color:blue;
text-decoration:underline;}
a:visited, span.MsoHyperlinkFollowed
{mso-style-priority:99;
color:purple;
text-decoration:underline;}
span.StileMessaggioDiPostaElettronica17
{mso-style-type:personal-compose;
font-family:"Calibri","sans-serif";
color:windowtext;}
.MsoChpDefault
{mso-style-type:export-only;}
@page Section1
{size:612.0pt 792.0pt;
margin:70.85pt 2.0cm 2.0cm 2.0cm;}
div.Section1
{page:Section1;}
-->
</style>
<!--[if gte mso 9]><xml>
<o:shapedefaults v:ext="edit" spidmax="1026" />
</xml><![endif]--><!--[if gte mso 9]><xml>
<o:shapelayout v:ext="edit">
<o:idmap v:ext="edit" data="1" />
</o:shapelayout></xml><![endif]-->
</head>
<body lang=IT link=blue vlink=purple>
<div class=Section1>
<p class=MsoNormal><span lang=EN-US>Call for Papers Matheuristics 2010 <o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>http://homepage.univie.ac.at/matheuristics2010<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US><o:p> </o:p></span></p>
<p class=MsoNormal><span lang=EN-US>The Matheuristics 2010 workshop is proposed
as a primary<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>forum for researchers working either on
exploiting mathematical<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>programming (MP) techniques in a
(meta)heuristic<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>framework or on granting to mathematical
programming<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>approaches the cross-problem robustness and
constrained-<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>CPU-time effectiveness which characterize
metaheuristics.<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>Discriminating landmark is some form of
exploitation of the<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>mathematical formulation of the problems of
interest.<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>Metaheuristic algorithms and frameworks,
such as tabu search,<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>genetic algorithms, VNS, etc., were in fact
usually proposed in<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>years when Mixed Integer Programming (MIP)
was seldom a<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>viable option for solving real-world
problem instances, or<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>significant subproblems thereof.<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>However, research on mathematical
programming, and in<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>particular on discrete optimization, has
led to a state of the art<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>where MIP solvers or customized MP codes
can be effective<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>even in a heuristic context, both as
primary solvers or as<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>subprocedures.<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>Matheuristics 2010 will help defining the
state of the art for the<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>computational effectiveness and efficiency
or theoretical<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>properties of integrated metaheuristics/MIP
codes (MH codes).<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>Matheuristics 2010 will be entirely
dedicated to this new<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>research option, the conference program
will consist only of<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>plenary presentations.<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US><o:p> </o:p></span></p>
<p class=MsoNormal><span lang=EN-US>Topics of interest include:<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>- Dual information and metaheuristics<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>- Decompositions and lower/upper bounds in
MH codes<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>- Upper and lower bounds interacting
evolutions<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>- Stochastic programming and heuristic
search<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>- Metaheuristics for stochastic problems<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>- Model-based metaheuristics<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>- MIP solvers as search components (local
branching, RINS, ...)<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>- Hybridizing (meta)heuristics and exact
methods<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>- Experimental analysis and modeling of
algorithms<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>- Real world case histories of successful
MH applications<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US><o:p> </o:p></span></p>
<p class=MsoNormal><span lang=EN-US>Matheuristics 2010 is not interested in
heuristics tailored to a<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>specific problem that have no element which
can be generalized<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>to other problems – no matter how
mathematically sophisticated<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>they are – nor in metaheuristics
variants which are not<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>justified by a mathematical model.<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US><o:p> </o:p></span></p>
<p class=MsoNormal><span lang=EN-US>Paper submission<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>Submitted papers must be between 8 and 12
pages long, written in English,<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>typeset in LaTeX2e.<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US><o:p> </o:p></span></p>
<p class=MsoNormal><span lang=EN-US>Important Dates<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>Deadline paper submission: February 15,
2010<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>Notification of acceptance: April 15, 2010<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>Deadline of the final paper: May 15, 2010<o:p></o:p></span></p>
<p class=MsoNormal>Conference: June 28–30, 2010<o:p></o:p></p>
<p class=MsoNormal><o:p> </o:p></p>
<p class=MsoNormal><span lang=EN-US>Conference Chair<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>Pierre Hansen HEC Montréal (Canada)<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>Vittorio Maniezzo University of Bologna
(Italy)<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>Stefan Voss University of Hamburg (Germany)<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US><o:p> </o:p></span></p>
<p class=MsoNormal><span lang=EN-US>Steering and Local Committee<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>Karl F. Doerner University of Vienna
(Austria)<o:p></o:p></span></p>
<p class=MsoNormal>Matteo Fischetti University of Padova (Italy)<o:p></o:p></p>
<p class=MsoNormal><span lang=ES>Michel Gendreau CIRRELT, Université de
Montréal (Canada)<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>Richard F. Hartl University of Vienna
(Austria)<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>Martin Savelsbergh Georgia Tech (USA)<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>Thomas Stuetzle ULB Bruxelles (Belgium)<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US><o:p> </o:p></span></p>
<p class=MsoNormal><span lang=EN-US>Contact<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>University of Vienna<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>Department of Business Administration<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>Bruenner Strasse 72<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>A-1210 Wien, Austria<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>Phone: +43 1 4277–38092<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>Fax: +43 1 4277–38094<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US>Email: matheuristics2010@univie.ac.at<o:p></o:p></span></p>
<p class=MsoNormal>http://homepage.univie.ac.at/matheuristics2010<o:p></o:p></p>
<p class=MsoNormal><o:p> </o:p></p>
<p class=MsoNormal><span style='font-family:"Courier New"'><o:p> </o:p></span></p>
<p class=MsoNormal><span style='font-size:10.0pt;font-family:"Courier New"'>________________________________________________________________<o:p></o:p></span></p>
<p class=MsoNormal><span style='font-size:10.0pt;font-family:"Courier New"'>Vittorio
Maniezzo, prof. || vittorio.maniezzo@unibo.it<o:p></o:p></span></p>
<p class=MsoNormal><span lang=EN-US style='font-size:10.0pt;font-family:"Courier New"'>Department
of Computer Science || tel. </span><span style='font-size:10.0pt;
font-family:"Courier New"'>+39 0547 338821<o:p></o:p></span></p>
<p class=MsoNormal><span style='font-size:10.0pt;font-family:"Courier New"'>University
of Bologna || fax. +39 0547 338890<o:p></o:p></span></p>
<p class=MsoNormal><span style='font-size:10.0pt;font-family:"Courier New"'>via
Sacchi, 3, 47023 Cesena, Italy || www.csr.unibo.it/~maniezzo<o:p></o:p></span></p>
<p class=MsoNormal><o:p> </o:p></p>
</div>
</body>
</html>