2012 conference, July 8-11, 2012, Vilnius (Lithuania).
If you are interested in organizing a MINLP session or to give a talk
within a MINLP session, please feel free to contact us. Abstracts are due
by February 29, 2012, but we request the session organizers to contact us
within a couple of weeks.
Mixed-Integer Nonlinear Programming (MINLP) is a sub-field of Mathematical
Programming specializing in modelling and solving one of the most general
(and hard) classes of optimization problems: namely, problems including
both nonlinear terms and integer variables. There are countless real-world
applications: in energy production, chemical engineering, scheduling,
software verification, quantum chemistry, air traffic management,
bioinformatics, nuclear engineering, and water distribution, for example.
Small and medium scale MINLPs are currently solved using a
Branch-and-Bound variant called "spatial Branch-and-Bound" (sBB), where
branching is allowed on continuous as well as discrete variables that
contribute to the gap between the original problem and its convex
relaxation. For large-scale variants one must currently resort to
heuristics, such as VNS, Feasibility Pump, Local Branching; or exploit the
problem structure to derive special-purpose methods. Alternative
approaches are studied for special cases of MINLP problems, like, for
example, convex MINLP and MIQP problems.
Sessions and talks focusing on both methodological developments and
applications are welcome.
More information about the EURO 2012 Conference can be found here:
http://www.euro-2012.lt
MINLP stream contacts:
Sonia Cafieri (sonia@recherche.enac.fr)
Claudia D'Ambrosio (dambrosio@lix.polytechnique.fr)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
