[DMANET] Open PhD / postdoc position at TU Berlin

Open research position at TU Berlin

The Combinatorial Optimization and Graph Algorithms Group at TU Berlin
(http://www.math.tu-berlin.de/coga/) invites applications for a research
position in the project "Scalable methods for the optimization of survivable
IP networks" within the BMBF joint research project "ROBUKOM - Robust
communication networks".

The position is a fixed-term full-time research position to be filled from
October 1, 2010 until March 31, 2013. Payment will be according to the
regulations for research employees at the TU Berlin (currently BAT IIa).

We are looking for a PhD student or postdoc who is or wishes to specialize
in discrete optimization. The successful candidate will participate in the
development and the implementation of mathematical models and algorithms to
solve large-scale optimization problems arising in the planning of
telecommunication networks. He or she will collaborate with 15+ researchers
in our group, interested in areas such as computational integer programming,
network flows, scheduling, online and robust optimization, graph theory, and
their application in practice.

Candidates must hold a Diploma, Master's, or equivalent degree in
mathematics or computer science and have very good knowledge in discrete
optimization, in particular in integer programming, combinatorial
optimization, and graph algorithms. The possibility to work towards a
doctoral degree will be given. Good command of C++ or an equivalent
programming language is required. Knowledge in telecommunication network
modeling and optimization would be appreciated.

Please address your application (including a cover and motivation letter, a
cv, copies of diplomas etc., addresses of references, and further
appropriate documentation) with the job reference number FO-315 to

President of TU Berlin
Inst. of Mathematics
Prof. Dr. Bley, Sekr. MA 5-2
Strasse des 17. Juni 136
10623 Berlin
Germany

and send it, preferably by email as a single pdf file, to Andreas Bley (see
below).

The closing date for applications is September 2, 2010.

For further information, please contact

Andreas Bley
Fak. II, Institute of Mathematics, Sekr. MA 5-2
Technische Universitaet Berlin
Strasse des 17. Juni 136
10623 Berlin, Germany
Email: bley@math.tu-berlin.de

**********************************************************
*
* 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/
*
**********************************************************

[DMANET] [GD2010] Call for Participation, Posters, PhD Expositions

=======================================================================
early registration deadline: August 22, 2010
=======================================================================

18th International Symposium
G R A P H D R A W I N G
(GD 2010)

21-24 September, 2010
University of Konstanz, Germany (on campus)

http://www.graphdrawing.org/gd2010/

=======================================================================
deadlines: posters Aug 16, PhD presentations Aug 23, contest Sep 17
=======================================================================

Graph Drawing is concerned with the geometric representation of graphs
and networks and is motivated by those applications where it is crucial
to visualize structural information as graphs.

Since graph drawing methods form the algorithmic core of network
visualization, bridging the gap between theoretical advances and
implemented solutions is an important aspect of the conference.

Indeed, advances in graph drawing are important in several technological
areas such as Web computing, e-commerce, VLSI circuit design,
information systems, software engineering, computational cartography,
visual interfaces, bioinformatics, and networking.

Researchers and practitioners working on any aspect of graph drawing
are invited to contribute and participate.

The range of topics includes, but is not limited to:

* visualization of networks from application areas such as the
life sciences, social sciences, geography, engineering,
business intelligence, or communications
* software systems for graph visualization
* interfaces for interacting with graphs
* graph drawing algorithms
* geometric graphs
* planarity and topological graph theory
* graph theory and optimization on graphs

Invited Speakers:
-----------------
Peter Eades, University of Sydney, Australia
Carsten Thomassen, Technical University of Denmark, Lyngby, Denmark

Accepted Papers:
----------------
A list of accepted papers and the preliminary program can be found on
the conference Web site at http://www.graphdrawing.org/gd2010/

Call for Participation:
-----------------------
GD will take place on the campus of the University of Konstanz, overseeing
beautiful Lake Constance. In addition to the main conference, a satellite
event will be held on Tuesday, September 21. This is

Call for Posters:
-----------------
Submissions of posters on graph drawing and related areas are also
solicited. The poster session will provide a forum for the communication
of late-breaking research results (which may also appear elsewhere) to
the graph drawing community. Posters should be accompanied by an abstract
(up to 2 pages); abstracts of accepted posters will be included in the
conference proceedings.

Call for PhD Colloquium submissions:
------------------------------------
PhD students will have an opportunity to present and exhibit their ongoing
or planned work in a dedicated workshop prior to the main conference.
We solicit submissions consisting of a poster and a status summary of
two pages. See http://www.graphdrawing.org/gd2010/progd.html for details.

Call for GD Contest submissions:
--------------------------------
Following the tradition of previous conferences, a graph drawing contest
will be held. See http://www.graphdrawing.de/contest2010/ for details.

Important Dates
---------------
Poster submission: August 16
Early registration deadline: August 22
PhD Colloquium submission: August 23
Contest submission: September 17
Symposium: September 21-24, 2010

Committees:
-----------
Contest Christian Duncan (Louisiana Tech)
Carsten Gutwenger (TU Dortmund)
Lev Nachmanson (Microsoft)
Georg Sander (IBM, chair)

Organization Melanie Badent
Ulrik Brandes (co-chair)
Sabine Cornelsen (co-chair)
Martin Mader
Barbara Pampel

Contact: gd2010@graphdrawing.org

=======================================================================
GD 2010 is supported by the University of Konstanz, DFG, and

Gold Sponsors: Tom Sawyer Software, yWorks
Silver Sponsor: IBM, Microsoft Research
Contributors: EADS, Siemens
=======================================================================

**********************************************************
*
* 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/
*
**********************************************************

[DMANET] Automating & Integrating Airport Operations, PhD studentship at the University of Nottingham

Automating & Integrating Airport Operations
PhD Studentship in the School of Computer Science, The University of
Nottingham

Studentships normally start in early October (2010), but flexibility is
possible here.
There is no closing date on this vacancy, but early application is
recommended.

Applications are invited for the above studentship, to be supervised by
Professor Edmund K. Burke and Dr Jason Atkin. The successful student
will join the current Integrating and Automating Airport Operations
project in the Automated Scheduling, Optimisation and Planning research
group (see: http://www.asap.cs.nott.ac.uk/) in the School of Computer
Science at the University of Nottingham. The group is currently involved
in a number of air transportation-related projects, further details of
which can be found here: http://www.asap.cs.nott.ac.uk/atr.

This studentship will join a large project across four UK universities,
to investigate the opportunities for increasing the level of automation
at airports. A number of airport operations are of particular interest
at Nottingham, including arrival and departure scheduling and
sequencing, the ground movement problem at airports, and the stand
allocation and stand resource allocation problems. These problems are
typically solved independently, and the two main areas of investigation
in this project are to increase the applicability of the problems to the
real world situations (considering increasingly realistic problems
rather than forming academic problems of interest by ignoring important
objectives and constraints) and to investigate the ways in which
simultaneous consideration of multiple problems (such as stand
allocation plus ground movement, rather than considering them
independently) can improve the overall efficiency of the system. This
project is supported by both Manchester and Zurich airports and some
site visits should be expected in order to understand the real details
of the problems under consideration. Further researchers on this
project, at Loughborough, Lincoln and Liverpool universities, will be
considering the human interaction issues, the multi-objective nature of
the problems and the baggage handling systems respectively. It is
currently envisaged that the successful student would, at least
initially, consider the stand allocation side of the system, including
the effects of stand allocation upon the other problems and the eventual
integration of this problem with the ground movement and sequencing
problems.

Students should have at least the equivalent of a UK upper second-class
honours degree (ideally a first class degree). They should preferably
have an undergraduate or Masters Degree in computer science, operational
research, mathematics or a closely related area. Students with a
mathematical background and good programming experience are especially
encouraged to apply.

This studentship is available for 3 years and includes an approximate
maintenance grant of 13,300 per year, and UK/EU tuition fees.
(Mantenance grants are not income and thus not subject to taxation, so
this is equivalent to a much higher income.) Due to funding
restrictions, this studentship is only open to UK/EU students.

Informal enquiries may be addressed to Dr J Atkin, tel: 0115 846 6531 or
Email: jaa@cs.nott.ac.uk. Please note that applications sent directly to
this Email address will not be accepted.

Applications, with a detailed CV, any supporting information (such as
why you wish to do a PhD, why this PhD in particular, along with any
details illustrating your suitability and skills) and the names and
addresses of two referees, should be sent to Ms D Pitchfork, School of
Computer Science, The University of Nottingham, Jubilee Campus, Wollaton
Road, Nottingham, NG8 1BB. Tel: 0115 846 6543. Email:
deborah.pitchfork@nottingham.ac.uk. Please quote ref. SCI/874.
**********************************************************
*
* 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/
*
**********************************************************

[DMANET] PhD studentship [SCI/879] - The LANCS Initiative

PhD Studentship
Hyper-heuristics for Grouping Problems
University of Nottingham - School of Computer Science

http://jobs.nottingham.ac.uk/vacancies.aspx?cat=345#j7933

This studentship is associated with The LANCS Initiative (see:
http://www.lancs-initiative.ac.uk/), particularly systems to build systems
research cluster. The successful student will join the Automated Scheduling,
OptimisAtion and Planning (ASAP) research group (see:
http://www.asap.cs.nott.ac.uk/) and have the opportunity to interact with
the leading scientists in the field. Most of the existing decision support
systems are developed based on expert knowledge and they are custom made for
a given problem solving environment. On the other hand, there is an emerging
class of intelligent methodologies that allow decision support systems
to
learn, adapt and improve their behavior, and/or their structure
automatically to accommodate complexities of real world problems. These
methodologies are applicable to different problem domains and aim to
raise
the level of generality by selecting and/or generating new methodologies
automatically during the search process. This exciting research area
lies at
the interface between operational research and computer science and
involves
understanding of representational issues, decision making mechanisms and
learning, design, implementation and analysis of hyper-heuristics. The
application domains will be cross disciplinary focusing on grouping
problems.

ASAP is one of four main research groups within the School of Computer
Science at Nottingham. ASAP has been carrying out innovative research
into
the development and investigation of decision support, search
methodologies
and machine learning for a wide and diverse range of real world problem
environments for the last decade. The group comprises 12 members of
academic staff, 19 researchers, 48 PhD students and three
administrators.

Students should have an undergraduate or Masters Degree in computer
science,
operational research, mathematics or closely related area or at least an
upper second-class honours degree (ideally a first class degree), or a
combination of qualifications and/or experience equivalent to that
level.
Knowledge of computational complexity theory, single and multi-objective
optimisation methodologies and machine learning is extremely desirable.
Students with a mathematical background, if they have good programming
experience, are also encouraged to apply.

This studentship is available for 3.5 years and includes an approximate
maintenance grant of GBP 13,300 per year, maintenance grant and UK/EU
tuition
fees.

Informal enquiries may be addressed to Dr E Ozcan, Email:
exo@cs.nott.ac.uk.
Please note that applications sent directly to this email address will
not
be accepted.

To apply, please access:
http://pgstudy.nottingham.ac.uk/apply-for-postgraduate-courses.aspx.
Please quote ref. SCI/879. Closing date: Open until filled.

**********************************************************
*
* 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/
*
**********************************************************

[DMANET] York - Zhejiang Summer School on Cognitive Communications

(Our apologies if you receive duplicates of this posting)

York - Zhejiang Summer School on Cognitive Communications

25 - 31 October 2010

Zhejiang University, Hangzhou, China

CALL FOR APPLICATIONS (Closing date 20th August 2010)

Thanks to funding from Research Councils UK in China
<http://www.rcuk.cn/rcuk/fore/index_en.php> and Worldwide Universities
Network <http://www.wun.ac.uk/> , the first York-Zhejiang 'Summer
School' on
Cognitive Communications will take place from 25 - 31 October 2010 at
Zhejiang University in Hangzhou, China. The central aim is to bring
together
100 like-minded research active individuals to explore the ever-growing
field of Cognitive Communications, which encompasses cognitive radio,
cognitive networks, and application of cognition to other aspects of
communications systems.

Supported by a team of ten expert lecturers, five from the UK and five
from
China, the programme includes tutorials, providing an in-depth
introduction
to key topics, lectures dealing with more specialist techniques,
workshops,
one centred on a mini-project "a tech-fest" to be undertaken during
the
week, the other giving delegates hands on experience of tools and
implementation. There will also be time for a short seminar and poster
session, to allow delegates to display their current research in the
area.
Briefings of various relevant projects from around the world will also
be
given. A visit to a local wireless communications company (or industrial
research lab such as Huawei Lab in Hangzhou) will provide further
interest
and diversity.

The evenings will be more devoted to cultural aspects, with a welcome
reception and banquet, and also themed events from the UK (pub quiz) and
China. The School is designed for Masters students, PhD students,
postdoctoral researchers and junior Lecturers with interests in
Cognitive
Communications. Courses will be comparable to first year graduate
courses.

For more information and how to apply please see:
www.summerschool2010.org
<http://www.summerschool2010.org/>

Key Aspects

* To train participants in new approaches to Cognitive Communications,
by spreading existing knowledge and expertise to the next generation of
the
researchers.
* Attendance capped at 100
* Limited number of bursaries available

* GBP 500 bursaries for attendees from institutions outside of
China
* 1000RMB bursaries for attendees from Chinese institutions

* Low registration fees

* Free for bursary holders
* GBP 175 (1750 RMB) for other attendees

* Important dates

* Closing date for applications 20th August 2010
* Notification of acceptance 31st August 2010

Lecturing Team

Dr David Grace (dg@ohm.york.ac.uk), Dr Paul Mitchell, Tim Clarke
(University
of York)
Dr Oliver Holland (King's College London) Dr Maziar Nekovee
(BT/University
College London)
Prof Honggang Zhang ( <mailto:honggangzhang@zju.edu.cn>
honggangzhang@zju.edu.cn), Dr Wei Wang (Zhejiang University)
Prof Lingyang Song (Peking University), Dr Wei Chen (Tsinghua
University),
Dr Xinbing Wang (Shanghai Jiaotong University)

________________________________________________________________________

Dr David Grace Email: dg@ohm.york.ac.uk

Head of Communications Research Group
Co-Director York-Zhejiang Lab for Cognitive Radio and Green
Communications
Department of Electronics, University of York
Heslington, York YO10 5DD United Kingdom
Phone: +44 (0)1904 432396 Fax: +44 (0)1904 432335

www.elec.york.ac.uk/staff/dg6.html www.wun-cogcom.org
__________________________________________________________________

p

**********************************************************
*
* 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/
*
**********************************************************

[DMANET] call for participation

12th Annual Congress of the French Society of Operations Research and
Decision Science (ROADEF)
March 2-4 2011, Saint-Etienne, France

http://www.emse.fr/roadef2011/

This is the 12th congress of the French Society of Operations Research
and Decision Science, which will be organized by the Ecole des Mines de
Saint-Etienne with the support of Telecom Saint-Etienne and the
University Jean-Monnet of Saint-Etienne.

ROADEF 2011 will be held in Saint-Etienne, France, on March 2-4, 2011.

The congress aims to provide a forum for academics, researchers and
practitioners to exchange ideas and recent developments in the field
ofOperations Research and Decision Science.
It is also an opportunity for young researchers to present their work.
Special sessions are also welcome within ROADEF 2011. If you wish to
propose a special session, please contact the Organizing Committee.

You are invited to submit abstracts (2 pages). Formatting details and
templates will be available at the ROADEF 2011 Website, soon.

Contact
Xavier Delorme and Alexandre Dolgui
Chair of the Organizing Committee of ROADEF 2011

General information : organisation-roadef2011@emse.fr
To propose a session : soumission-roadef2011@emse.fr

____________________________________________________________________

Alexandre Dolgui, Dr.Hab., Ph.D.
Professor
Director of the Centre for Industrial Engineering and Computer Science
Ecole des Mines de Saint-Etienne
/National Institute of Science and Technology@Saint-Etienne/
158, Cours Fauriel, 42023 Saint-Etienne cedex 2, France
Fax: +33 (0)4.77.42.66.66
E-mail: dolgui@emse.fr
URL: www.emse.fr/~dolgui

New book:
Supply Chain Engineering: Useful Methods and Techniques, Springer
http://www.springer.com/engineering/production+eng/book/978-1-84996-016-8

_____________________________________________________________________

**********************************************************
*
* 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/
*
**********************************************************

[DMANET] Researcher (m/w) fuer Modellbildung und Optimierung im Verkehrsbereich

AIT Austrian Institute of Technology, das Oesterreichische Forschungsinsti
tut von europaeischem Format, das sich mit den zentralen Infrastrukturthem
en der Zukunft beschaeftigt, sucht zur Verstaerkung des Teams zum ehest m
oeglichen Eintritt eine/n

Researcher (m/w) fuer Modellbildung und Optimierung im Verkehrsbereich

Taetigkeiten:
- Sie entwickeln mathematische Modelle und Optimierungsalgorithme
n fuer angewandte Problemstellungen aus dem Verkehrsbereich. Ausserdem si
nd Sie aktiv in der Konzeption und Anbahnung von Forschungs- und Kooperatio
nsprojekten mit Unternehmen und F&E-Einrichtungen taetig. Als wissenschaft
liche/r Mitarbeiter/in sind Sie sowohl an der erfolgreichen Umsetzung als a
uch an der Publikation Ihrer Forschungsergebnisse interessiert.
Qualifikation:
- Abgeschlossenes Universitaetsstudium in einem technisch-naturw
issenschaftlichen Bereich
- (zB Informatik, Mathematik), vorzugsweise Promotion und wissens
chaftliche Publikationstaetigkeit
- Nachgewiesene ausgezeichnete Kenntnisse in Methoden zur Modellb
ildung und kombinatorischen Optimierung, idealerweise gute Kenntnisse in St
atistik und stochastischer Optimierung
- Nachgewiesene gute Programmierkenntnisse in Java, C++, vorzugsw
eise auch Matlab/R und ein hohes Verständnis von Datenstrukturen und Komp
lexitaet
- Selbstmotivation, analytisches Denken und loesungsorientierte
Suche nach den Grundlagen von wissenschaftlichen Problemstellungen
- Gute Kommunikationsfaehigkeit in Englisch
- Begeisterungsfaehigkeit fuer unkonventionelle Loesungen, Kre
ativitaet und Visionskraft

Dienstort: Wien
Interessent/innen, die ihr Wissen, ihr Netzwerk, ihre Ideen und ihre Kreati
vität gerne im Umfeld der angewandten Forschung einbringen wollen, wenden
sich bitte mit ihren aussagekraeftigen Bewerbungsunterlagen inklusive Zeu
gnissen und Foto an

Frau Maria Maurer, MSc
Leiterin Personalservices
2444 Seibersdorf
Tel.: +43(0) 50550 - 2032
maria.maurer@ait.ac.at<mailto:maria.maurer@ait.ac.at>

http://bewerber.ait.ac.at/

**********************************************************
*
* 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/
*
**********************************************************

[DMANET] 4th Algorithms and Complexity in Durham Workshop: ACiD 2010

Call for participants

Fourth Algorithms and Complexity in Durham Workshop: ACiD 2010

20-22 September, 2010, Durham University, UK

http://www.dur.ac.uk/acid.2010/

We invite submission of short abstracts (1 page) of talks to be
presented at the workshop. The deadline for submission is 31 August.

-----------------------------------------------------------

INVITED LECTURES

* Amin Coja-Oghlan (University of Warwick)

* Bill Jackson (Queen Mary University of London)

* Dieter Kratsch (University of Metz)

* Sarah Rees (University of Newcastle)

* Rahul Santhanam (University of Edinburgh)

-----------------------------------------------------------

SCOPE

The workshop is intended to be a forum for researchers working on all
aspects of algorithms and complexity. Possible topics include, but are
not limited to

-Algorithm Design and Analysis
-Computational Complexity
-Randomized Algorithms
-Algorithmic Graph Theory
-Combinatorial Algorithms
-Approximation Algorithms
-Applications of Algorithms
-Constraint Satisfaction
-Exact and Parameterized Computation
-Proof Complexity
-Databases and Information Retrieval
-Quantum Computing
-Discrete Optimization

During the workshop, a total of up to 40 talks will be presented in a
series of non-parallel sessions. Talks, other than the invited
lectures, will be 30 minutes in length.

-----------------------------------------------------------

LOCAL COMMITTEE

Iain Stewart
Daniel Paulusma
Matthew Johnson

Please send questions and comments to acid.2010_at_durham.ac.uk
-----------------------------------------------------------
**********************************************************
*
* 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/
*
**********************************************************

[DMANET] Extended Deadline: Special Issue on Heuristic Search Methods for Large Scale Optimization Problems in Industry, Evolutionary Computation Journal

Special Issue on
Heuristic Search Methods for Large Scale Optimization Problems in
Industry

Evolutionary Computation Journal, MIT Press
http://ecj.lri.fr/

EXTENDED DEADLINE: August 31, 2010.

Guest Editors:
Andreas Ernst, CSIRO Mathematical and Information Science,
andreas.ernst@csiro.au
Zbigniew Michalewicz, University of Adelaide,
zbigniew.michalewicz@adelaide.edu.au
Frank Neumann, Max Planck Institute for Informatics, fne@mpi-inf.mpg.de

Description:
This special issue aims to provide a forum for researchers working on
large applied optimization problems arising in industry. Such problems
often defy solution by exact approaches such as integer and constraint
programming. Particular challenges of large applied problems include the
presence of complex objectives containing a mixture of real costs and
soft constraints which can be time consuming to evaluate. In addition
the search space of problems is often so large that traversing it with
neighbourhood-move, crossover or mutation operators can take too long to
allow effective exploration. This special issue solicits novel
high-quality contributions on heuristic methods for large applied
optimization problems that have been used in practice. While papers on
any aspect of solving large scale optimization problems in industry are
welcome, of special interest are submissions on:

-Scheduling/planning problems solved for particular organizations
-Novel methods for exploring very large search spaces
-Decomposition and parallel computing techniques for solving large
optimization problems
-Hybrid heuristics for real world optimization problems
-Methods for dealing with large data sets in formulating and solving
large optimization problems, including issues around data consistency
and completeness.
-Case studies of successful (or unsuccessful) implementations of large
scale heuristic optimization algorithms in a business and lessons
learned from these.

Authors are encouraged to make available (de-identified) versions of
some of their real world data sets to support the development of more
sophisticated methods to deal with some of these challenging problems.
This special issue will not consider the solution of large abstract
problems (eg classical VRP or job shop scheduling problems) nor papers
that only test algorithms on randomly generated data sets. Authors are
invited to submit original work on topics relevant for this special
issue. The publication of the special issue is tentatively scheduled for
Summer 2011.

Submission:
Authors should submit their manuscripts to the Evolutionary Computation
Editorial Manager at http://ecj.lri.fr/.
When submitting a paper, please send at the same time also an
email to Frank Neumann (fne@mpi-inf.mpg.de) and a copy to ecj@lri.fr
mentioning the special issue, the
paper title, and author list to inform about the submission.
**********************************************************
*
* 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/
*
**********************************************************

[DMANET] Position at the University of Sydney

LECTURER/SENIOR LECTURER IN MACHINE LEARNING
School of Information Technologies
Faculty of Engineering & IT
University of Sydney

The School of Information Technologies (SIT), University of Sydney, invites
applications from outstanding candidates for a continuing (tenure-track)
position at the Lecturer (Level B)/Senior Lecturer level (Level C). This is
a career opportunity in algorithmic machine learning.

For more information visit http://bit.ly/9dU3FY
**********************************************************
*
* 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/
*
**********************************************************

[DMANET] call for PhD student applications

The Centre for Industrial Engineering and Computer Science at the Ecole des
Mines de Saint-Etienne, France, invites applications for a position of PhD
Student

Research area: discrete optimization of stochastic systems.

Supervisors: Prof. Alexandre Dolgui, Dolgui@emse.fr, et Dr. Helene Marian,
marian@emse.fr (Assistant Professor)

Project description:

The Material Requirement Planning (MRP) approach is widely used in industry
for production planning and supply management. In MRP for a deterministic
environment without constraints and under a lot for lot policy, the items
are delivered just-in time (JIT). Nevertheless, under actual operating
conditions, there are always random factors, and thus, stockouts are
possible. Therefore, it is necessary to find the methods to adapt the MRP
techniques to these real world situations. Fortunately, MRP has several
parameters to configure it. An adequate choice of these parameters can fine
tune MRP to deal with a more realistic work setting. Thus, one of crucial
issues of MRP is its parameterization for real life enterprises and situations.

We have already begun to explore this problem. For Lot for Lot policy, in
(Dolgui and Louly, 2002), a Markov model was suggested. A special case of
this problem was considered in (Louly and Dolgui, 2002), when all
components have identical properties, i.e. the same lead time probability
distribution and same unit holding cost. In (Louly et al, 2008), the same
problem was considered, but for minimizing holding cost only, while
backlogging cost is replaced with a service level constraint. The formulas
obtained in (Louly and Dolgui, 2002) and (Louly et al, 2008) for optimal
planned lead times represent new generalizations of the Discrete Newsboy
model.

In this new PhD thesis we plan extends our previous results by considering
diverse lot-sizing policies and without the restrictive assumptions on the
holding costs and probability distributions. From a practical point of
view, this provides more general and comprehensive model and cost
evaluation than in the earlier work.

References
- Dolgui A., Ould Louly M.-A. (2002). A Model for Supply Planning
under Lead Time Uncertainty. International Journal of Production Economics,
78, 145-152
- Ould Louly M.-A., Dolgui A. (2002). Newsboy model for supply
planning of assembly systems. International Journal of Production Research,
40(17), 4401-4414.
- Ould Louly M.-A., A. Dolgui, and F. Hnaien, (2008). Supply planning
for single-level assembly system with stochastic component delivery times
and service level constraint, International Journal of Production
Economics, 115(1), 236-247.

Responsibilities:

The PhD position is available immediately for a duration of three years and
includes research and teaching (40 hours year). The employment is full-time
and comes with a competitive salary of 1800 euros/month. You will be given
the opportunity to present your research results at international conferences.

Qualifications:

The position requires a Master's degree (or equivalent) in Industrial
Engineering and Operations Research, or related areas. Proficiency in
English, strong team spirit, social skills, independence and a high level
of motivation for demanding research work further core qualifications.

Applications:

Inquiries and applications including a detailed CV, transcripts, a record
of attended courses (with grades), and a copy of the Master's thesis should
be addressed to: dolgui@emse.fr and marian@emse.fr or by mail to:

Prof. Dr. Alexandre Dolgui
Ecole des Mines de Saint-Etienne
158, cours Fauriel
42023 Saint-Etienne, France

URL: www.emse.fr/~dolgui

____________________________________________________________________

Alexandre Dolgui, Dr.Hab., Ph.D.
Professor
Director of the Centre for Industrial Engineering and Computer Science
Ecole des Mines de Saint-Etienne
/National Institute of Science and Technology@Saint-Etienne/
158, Cours Fauriel, 42023 Saint-Etienne cedex 2, France
Fax: +33 (0)4.77.42.66.66
E-mail: dolgui@emse.fr
URL: www.emse.fr/~dolgui

New book:
Supply Chain Engineering: Useful Methods and Techniques, Springer
http://www.springer.com/engineering/production+eng/book/978-1-84996-016-8

_____________________________________________________________________

**********************************************************
*
* 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/
*
**********************************************************

[DMANET] PhD Positions at Linkoeping University

The Department of Computer Science at Linkoeping University announces
several PhD student positions within the graduate school in computer
science (CUGS).

The scientific scope of CUGS includes the following areas:

-Autonomous systems and artificial intelligence (prof. P. Doherty)
-Security engineering, and database and web information systems
(prof. N. Shahmehri)
-Embedded systems (prof. Z. Peng)
-Dependable systems and networks (prof. S. Nadjm-Tehrani)
-Software engineering (prof. P. Fritzson)
-Theoretical computer science (prof. P. Jonsson)

More information about the positions and the application procedure
can be found here:

http://www.liu.se/en/job/show.html?3533

Deadline: August, 15.
**********************************************************
*
* 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/
*
**********************************************************

[DMANET] CFP: Special Issue of Discrete Applied Mathematics on Graphs and Optimization

CALL FOR PAPERS: Special Issue of Discrete Applied Mathematics on
Graphs and Optimization

We invite submissions of research papers for a forthcoming special
issue of Discrete Applied
Mathematics on Graphs and Optimization.

This special issue is dedicated to the Seventh International
Colloquium on Graphs and Optimization
(GO VII) which took place in Ovronnaz, Switzerland, June 13 – 17, 2010
and was organized in honor of
four people who made remarkable contributions in the area of graphs
and optimization:
Maurice Cochand, Alain Hertz, Alain Prodon and Marino Widmer.

The call is not limited to the participants of the meeting and is open
to all papers related to the main
theme of the event. Topics of interest include, but are not limited to:

- Scheduling
- Logistics and Supply Chain Management
- Computational Complexity
- Graph and Network Algorithms
- Graph Coloring
- Graph Classes
- Graph Invariants
- Network Design
- Integer Linear Programming
- Polyhedral Algorithms for Graph Problems

The deadline for submissions of full papers is November 30, 2010.

All papers will be thoroughly referred according to the high standards
of the journal.
In order to submit their papers, the authors must follow the
guidelines on the journal website
http://ees.elsevier.com/dam/. Be sure to note that your work is
intended for the Special Issue and to
select the article type Special Iss: GO VII.

Guest Editors:
Marc Demange, demange@essec.edu
Vadim Lozin, v.lozin@warwick.ac.uk
Christophe Picouleau, chp@cnam.fr
Bernard Ries, bernard.ries@wbs.ac.uk
**********************************************************
*
* 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/
*
**********************************************************

[DMANET] Post-Doctoral Fellowship in Operations Research and Pattern Recognition

Applications are invited for a Post-Doctoral position in Operations
Research and Pattern Recognition at the School of Management of
Politecnico di Milano, in the research group MOLD on Mathematical
Modeling, Optimization, Learning from Data (http://www.mold.polimi.it).

The area of research is Operations Research with focus on Optimization,
Machine Learning and Pattern Recognition, and applications to Economics,
Management, Life Sciences.
Strong applicants in other areas of Operations Research will be also
considered.

Candidates should be within 5 years (or close to completion) of their
Ph.D. in Operations Research, Computer Science, Statistics, Applied
Mathematics, Management, or a related discipline.

The position will include also a teaching component (less than 5% of
total working time) as Teaching Assistant and Laboratory Instructor.
Since the position is in Italy some knowledge of Italian will be
appreciated. The scientific working language could be English.

The initial contract will be for 6-12 months with a possibility of
extension for up to 2-3 years.

To apply, send a CV and a sample of recent research (papers, preprints,
etc.) electronically to Prof. Carlo Vercellis (carlo.vercellis@polimi.it).
For further information call +39 02 23992784/+39 02 23993970.

***
Carlotta Orsenigo
Assistant Professor of Operations Research
School of Management
Politecnico di Milano
Tel: +39 02 2399 3970
**********************************************************
*
* 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/
*
**********************************************************

[DMANET] PRELIMINARY ANNOUNCEMENT - CTW 2011

PRELIMINARY ANNOUNCEMENT

CTW 2011
10th Cologne-Twente Workshop on Graphs & Combinatorial Optimization
CALL FOR PAPERS

Università di Roma "Tor Vergata", Villa Mondragone,
Frascati (Rome), Italy, June 14-16, 2011.

***

The tenth Cologne-Twente Workshop on Graphs and Combinatorial
Optimization 2011 welcomes contributions on theory and applications of
discrete algorithms, graphs and combinatorial structures in the wide sense.

The previous editions were held in Koeln, D (2010, 2005, 2001), Paris, F
(2009), Gargnano, I (2008), Enschede NL (2007,2003), Lambrecht, D
(2006), Menaggio, I (2004). Following a well established tradition, the
10-th edition of the workhop aims to disseminate scientific results,
especially by young researchers, in a friendly and interactive atmosphere.

***

Further details will be available soon.

E-MAIL:
ctw2011@dia.uniroma3.it
CONFERENCE WEBSITE:
http://ctw2011.dia.uniroma3.it

SCIENTIFIC COMMITTEE
U. Faigle (U. Cologne), J.L. Hurink (U. Twente), L. Liberti (Ecole
Polytechnique, Paris), F. Maffioli (Politecnico, Milano), G. Nicosia (U.
Roma Tre), A. Pacifici (U. Roma Tor Vergata), G. Righini (U. Milano), R.
Schrader (U. Cologne), R. Schultz (U. Duisburg-Essen).

LOCAL ORGANIZATION
L. Adacher, M. Flamini, G. Leo, G. Nicosia, A. Pacifici, V. Piccialli
- Dipartimento di Informatica e Automatica, Università di Roma Tre,
Roma, Italy
- Dipartimento di Ingegneria dell'Impresa, Università di Roma Tor
Vergata, Roma, Italy
- Cento Conferenze Villa Mondragone www.villamondragone.it

**********************************************************
*
* 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/
*
**********************************************************

[DMANET] 34ACCMCC Call for participation

34ACCMCC: The 34th Australasian Conference on Combinatorial
Mathematics & Combinatorial Computing
Date: 6-10 December 2010
Venue: The Australian National University, Canberra, Australia
Website: http://www.maths.anu.edu.au/events/34accmcc/34accmcc.html

ACCMCC, the Australasian Conference on Combinatorial Mathematics and
Combinatorial
Computing, is the annual conference of the Combinatorial Mathematics
Society of Australasia.
This year it will be held at the Australian National University in
Canberra, Australia.
The conference covers all areas of combinatorics in mathematics and
computer science.
The first two days of the conference will run concurrently with the
Annual Australian
Statistical Mechanics Meeting. Registration will be available shortly.

The following people will be giving invited talks.

- Emeritus Professor Richard Brualdi, University of Wisconsin
- Dr Darryn Bryant, University of Queensland
- Dr Catherine Greenhill, University of New South Wales
- Dr Petteri Kaski, University of Helsinki
- Dr Ian Wanless, Monash University
- Professor Catherine Yan, Texas A&M University

Attendees (especially students) are invited to give contributed talks.
Topics relating to
statistical mechanics are welcomed. Contributed talks are 20 minutes
in length with an
additional 5 minutes for questions. The CMSA Student Prize will be
awarded to the best
student talk at the conference.
**********************************************************
*
* 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/
*
**********************************************************

[DMANET] MAC2010: Distributed Computing by Mobile Robots

___________________________________________________________________
RESEARCH MEETING AND SCHOOL

ON

DISTRIBUTED COMPUTING BY MOBILE ROBOTS

___________________________________________________________________
http://www.scs.carleton.ca/~santoro/MAC/MAC-2010.html

The Research Meeting and School on Distributed Computing by Mobile Robots
takes place August 15-18, 2010 at Carleton University in Ottawa, Canada.

Distributed robot computing is the study of complexity and computability
in systems where the computational entities themselves are capable of
movement within the spatial universe they inhabit. The field has
applications in areas as diverse as autonomous robots moving in a terrain,
software agents moving in a network, autonomous intelligent vehicles,
wireless mobile ad-hoc networks, and networks of mobile sensors.
The goal of the research meeting is to bring together researchers working
in this areas in order to exchange problems, ideas, techniques, and results.
The objective is to create a clearer picture of the state of the art in the
field, to identify outstanding open problems and research directions, and to
foster collaborative investigation of selected problems.

The event includes participation by graduate students and post-doctoral
fellows, who will attend it as a research school.
There will be lectures of a survey/tutorial nature, invited talks on
specific current research topics and open problems. The discussion and study
of these open problems will constitute integral part of the event.
In its dual nature of research meeting and research school we expect that
the event will expose graduate students and post-doctoral fellows to
important problems in this growing field.
Due to its particular nature, the number of participants is limited.

Organizing Committe
--------------------
Paola Flocchini, SITE, University of Ottawa
Matthew Kellett, Defence R&D Canada
Giuseppe Prencipe, Dipartimento di Informatica, University of Pisa
Nicola Santoro (Chair), School of Computer Science, Carleton University

Contacts
--------
mac2010@scs.carleton.ca

Sponsors
---------
Fields Institute - http://www.fields.utoronto.ca/aboutus
MITACS - http://www.mitacs.math.ca
SCS - http://www.scs.carleton.ca

**********************************************************
*
* 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/
*
**********************************************************

[DMANET] IWOGL 2010 -- 2nd Call For Papers

Apologies for multiple postings!

IWOGL 2010

6th International Workshop on Graph Labelings

October 20-22, 2010, University of Minnesota Duluth

2nd Call For Papers

http://www.d.umn.edu/math/iwogl/
iwogl@d.umn.edu

The workshop will cover all aspects of graph
labelings.
There will be four keynote lectures, several
invited lectures,
contributed talks by participants, and hopefully
enough time
for discussions and collaborative research.

(IWOGL 2010 will be followed by MIGHTY L, held on
October 23
at University of Wisconsin-Superior campus just
across
the bridge!)

Keynote Speakers:

S. Arumugam, Kalasalingam University, India
Joseph Gallian, University of Minnesota Duluth, U.S.A.
Uwe Leck, University of Wisconsin-Superior, U.S.A.
Alexander Rosa, McMaster University, Canada

Deadlines:

Abstract submission October 1
Early registration September 10

Conference fee: $100/$120 (early/regular)
The fee can be now paid through our online form at
https://ibex.d.umn.edu/biz/ce/conferences/iwogl/

To help us with planning the event, please
register at
http://www.d.umn.edu/math/iwogl/registration.html
This will give us better idea what number of
participants
we can expect.

A block of rooms has been reserved in Radisson Hotel
in downtown Duluth. To make a reservation, call
218-727-8981 or email to rhi_dulu@radisson.com and
mention
IWOGL 2010. Special rate valid until October 18.

Organizing Committee

Dalibor Froncek, University of Minnesota
Duluth (Chair)
Mirka Miller, University of Newcastle,
Australia (Program Chair)
Sergei Bezrukov, University of
Wisconsin-Superior
Suresh Hegde, NIT Karnataka, India
Yuqing Lin, University of Newcastle, Australia
Steve Rosenberg, University of
Wisconsin-Superior

iwogl@d.umn.edu
http://www.d.umn.edu/math/iwogl/

**********************************************************
*
* 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/
*
**********************************************************

[DMANET] ALGO 2010 Reminder: Early registration deadline 31 July

ALGO 2010 is being held 6-10 Sept 2010 in Liverpool,
United Kingdom and consists of four events:

18th Annual European Symposium on Algorithms
10th Workshop on Algorithms in Bioinformatics
10th Workshop on Algorithmic Approaches for Transportation
Modelling, Optimization, and Systems
8th Workshop on Approximation and Online Algorithms

Early registration ends 31 July 2010!

Main website: http://algo2010.csc.liv.ac.uk/
Registration: http://algo2010.csc.liv.ac.uk/register/

See you in September!
**********************************************************
*
* 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/
*
**********************************************************

[DMANET] New deadline for the special issue of Discrete Applied Mathematics

New deadline for the special issue of Discrete Applied Mathematics
Dedicated to ISCO 2010 : October 15, 2010.

We would like to inform you that the deadline for submitting a
Paper to the sepcial issue of Discrete Applied Mathematics,
Dedicated to ISCO 2010 is posponed to October 15, 2010.

Regards
Ridha Mahjoub

**********************************************************
*
* 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/
*
**********************************************************