[We apologize for multiple receipts]
======================================================
MAPSP 2013 - Call for participation
======================================================
The 11th Workshop on Models and Algorithms for Planning and Scheduling Problems
June 23 - 28 , 2013
Abbaye des Prémontrés, France
http://mapsp2013.loria.fr
======================================================
We invite you to participate to the 11th Workshop on Models and
Algorithms for Planning and Scheduling Problems, that will be held
from June 23-28, 2013 in Pont à Mousson in Abbaye des Prémontrés (see
http://www.abbaye-premontres.com/site_en/index.html). The
registration is now open, with an early registration deadline on April
27, 2013. (see http://mapsp2013.loria.fr/registration.html). The
registration fees cover all meals, coffee breaks, social event and 1
beer Abbaye des Prémontrés. Registration with accommodation within the
abbey is also proposed as well as alternative accommodation within
Pont à Mousson.
MAPSP is a biennial workshop dedicated to all theoretical and
practical aspects of scheduling, planning, and timetabling. Previous
MAPSP meetings have been held in Menaggio, Italy (1993), Wernigerode,
Germany (1995), Cambridge, UK (1997), Renesse, Netherlands (1999),
Aussois, France (2001), Aussois, France (2003), Siena, Italy (2005),
Istanbul, Turkey (2007), Abbey Rolduc, Netherlands (2009) and Nymburk,
Czech Republic (2011).
This year edition is hosted by Abbaye des Prémontrés. The abbey, now a
conference center, is a beautiful Baroque style built in the early
18th century to host, originally, the Norbertine order. During our
conference you may admire its gardens while enjoying fine French food
and drink the surprising Lorraine beer, the abbey has its own flavor.
The scientific program contains three invited talks, four tutorials,
ten plenary talks and more than 60 regular talks. The detailed program
is now available on our website (see
http://mapsp2013.loria.fr/program.html). The social program includes a
guided tour of the historical center of Nancy, dinner at City Hall and
the lights and sound show in the beautiful Stanilas place. The
traditional sport contest will also allow the participants to discover
Lorraine hills. A (optional) social program is proposed to
accompanying people (and not only) and it contains visits to Lorraine
brewery of Pont à Mousson, the Art Nouveau Museum in Nancy, Pompidou
Museum in Metz and the Paper Museum in Pont à Mousson.
Facilitates are offered to participants traveling with children. For
further information, you may refer to the conference website.
======================================================
Invited speakers:
Anupam Gupta - Approximation Algorithms for Stochastic Packing Problems
Magnus M. Halldorsson - Wireless scheduling
Ola Svensson - Strong Convex Relaxations for Allocation Problems
======================================================
Tutorials
Klaus Jansen - Efficient polynomial time approximation schemes
Viswanath Nagarajan - Approximation algorithms for robust optimization
Seffi Naor - Submodular maximization: recent progress
Thomas Rothvoss - An introduction to the Lasserre Hierarchy in
approximation algorithms
======================================================
Registration fee:
Early registration: 400 €
Regular registration: 550 €
Late registration: 700 €
======================================================
Program Committee:
Nikhil Bansal (TU Eindhoven, Eindhoven, chair), Vincenzo Bonifaci
(IASI-CNR, Rome), Niv Buchbinder (Tel-Aviv University, Tel-Aviv)
Jose Correa (Universidad de Chile, Santiago), Liliana Cucu-Grosjean
(INRIA, co-chair), Amit Kumar (IIT Delhi, New Delhi)
Asaf Levin (Technion, Haifa), Viswanath Nagarajan (IBM Research,
Yorktown Heights), Britta Peis (TU Berlin, Berlin)
Thomas Rothvoss (MIT, Cambridge), Rene Sitters (Vrije Universiteit,
Amsterdam), Rob van Stee (MPI, Saarbruecken), Andreas Wiese (MPI,
Saarbruecken)
======================================================
Organizing Committee:
Nikhil Bansal, Anne-Lise Charbonnier, Adriana Gogonel, Dorin Maxim,
Cristian Maxim, Ammar Oulamara, Mehdi Serairi, Louisa Touioui
**********************************************************
*
* 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/
*
**********************************************************