Friday, October 19, 2018

[DMANET] EJOR Feature Cluster - New Trends in Applied Combinatorial Optimization - Deadline Approaching: Paper Submission Due November 1, 2018

Apologies for cross posting
——————————————————

Deadline Approaching: Paper Submission Due November 1, 2018

Call For Papers: EJOR Feature Cluster - New Trends in Applied Combinatorial Optimization

Although we encourage the submission of papers presented at the Joint EURO/ALIO International Conference 2018 on Applied Combinatorial Optimization, this Call for Papers is open to the entire community of academics and practitioners working in the field of applied combinatorial optimization.


Motivation

Applied Combinatorial Optimization has always received large interest in the scientific community. Thanks to the development of effective methods and innovative techniques, hard real-world problems can now be solved more efficiently, and new challenges arise, such as considering uncertain conditions, combining hard problems together, solving problems in real-time. The aim of the Feature Cluster "New trends in Applied Combinatorial Optimization" is to bridge the gap between science and real-world, by providing effective formulations and algorithms that allow solving practical problems. We solicit original and high-quality papers presenting innovative research in the field of Applied Combinatorial Optimization.


Contents

We will consider high-quality manuscripts addressing theoretical achievements, algorithm development and real-world implementations in the context of applied combinatorial optimization.

Topics of interest include (but are not limited to):

- Applications of Combinatorial Optimization
- Approximation algorithms
- Branch-and-cut-and-price algorithms
- Computational complexity
- Emerging applications of OR
- Energy planning
- Graph theory
- Healthcare applications
- Heuristics, metaheuristics and matheuristics
- Hybrid methods
- Integer programming
- Natural resource management
- Network design and analysis
- Production planning
- Telecommunications
- Transportation and logistics


Submission

Prospective authors are asked to follow the EJOR guide for authors and submit their papers from August 1, 2018 via the EES (http://ees.elsevier.com/ejor). Please select "Feat.Cluster App.Comb.Opt" as the "Article Type" during the submission process. Submitted papers will undergo a regular review process according to the high standard of EJOR.

Important Dates

Paper Submission Opening: August 1, 2018
Paper Submission Due: November 1, 2018
Notification of Review Results: February 15, 2019
Revised Manuscript Due: April 30, 2019
Final Decision: July 31, 2019

Guest Editors

Valentina Cacchiani, University of Bologna
Enrico Malaguti, University of Bologna
Paolo Toth, University of Bologna
**********************************************************
*
* 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/
*
**********************************************************

Thursday, October 18, 2018

[DMANET] 2 Assistant professor positions in machine learning, data analytics, big data and other specialties.

We have 2 assistant professor positions in computer science with a broad focus. Preference will be given to candidates specializing in any of the following broad areas: (i) cloud computing and distributed systems, preferably with networking and service architecture knowledge; (ii) machine learning, data analytics, and big data, preferably with a focus on neural networks; (iii) cyber security and networking; or (iv) software engineering.

Considering the broad focus, some DMANet members may be interested. For details including how to apply, see https://cosc.ok.ubc.ca/faculty-jobs.html

**********************************************************
*
* 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] SoCG 2019: Second Call for Papers

35th SoCG - Portland, Oregon - June 18-21, 2019


******* SoCG 2019, Call for Papers*************


The 35th International Symposium on Computational Geometry (SoCG 2019)
will be held in Portland, Oregon, June 18-21, 2019, as part of the
Computational Geometry (CG) Week. We invite submissions of high quality
that describe original research on computational problems in a geometric
setting. Topics of interest include, but are not limited to:
• Design, analysis, and implementation of geometric algorithms and data
structures;
• Lower bounds on the computational complexity of geometric problems;
• Mathematical, numerical, and algebraic issues arising in the
formulation, analysis, implementation, and experimental evaluation of
geometric algorithms and heuristics;
• Discrete and combinatorial geometry;
• Computational topology, topological data analysis, and topological
combinatorics;
• Applications of computational geometry in any field.

To ensure that a submission is evaluated on its own merits, authors will
need to identify the main strengths of their submission, as captured by
four possible paper types. Please consult the last section of this CFP
(or the conference web-page) for a detailed description of the paper types
and associated evaluation criteria. There are no quotas for the paper
types and submissions can be labeled with more than one paper type at the
time of submission.


*Conference Web Page*

http://eecs.oregonstate.edu/socg19


*EasyChair Link*

https://easychair.org/conferences/?conf=cgweek2019


*Important Dates*

• November 28, 2018 (Wednesday): Abstracts due (23:59 PST)
• December 5, 2018 (Wednesday): Papers due (23:59 PST)
• February 15, 2019 (Friday): Notification of acceptance/rejection
• March 15, 2019 (Friday): Final versions of accepted papers due
• June 18-21, 2019 (Tuesday-Friday): Symposium


*Submission Guidelines*

Submissions must be formatted in accordance with the LIPIcs proceedings
guidelines and not exceed 500 lines, excluding front matter, references,
and a clearly marked appendix (further described below). Note that figures
and tables are not counted towards the 500 lines, but their captions are.
To ensure an accurate line counting, authors must use the LaTeX class file
socg-lipics-v2018, which is a wrapper around the standard class. The
class file, as well a document describing the motivation and
technicalities behind this class, are available from the SoCG webpage
(http://computational-geometry.org). We trust the authors not to put
excessive amounts of texts in parts in which lines are not counted
automatically. If authors need constructs that contain large amounts of
uncounted text, they should compensate for this by reducing the final
count accordingly.

Papers should be submitted in the form of an extended abstract, which
begins with the title of the paper, each author's name and affiliation, as
well as a short abstract. This should be followed by the main body of the
paper that begins with a precise statement of the problem considered, a
succinct summary of the results obtained (emphasizing the significance,
novelty, and potential impact of the research), and a clear comparison
with related work. The remainder of the extended abstract should provide
sufficient details to allow the program committee to evaluate the
validity, quality, and relevance of the contribution. Clarity of
presentation is very important; the entire extended abstract should be
written carefully, taking into consideration that it will be read and
evaluated by both experts and non-experts, often under tight time
constraints. All details needed to verify the results must be provided.

Supporting materials, including proofs of theoretical claims and
experimental details, that do not fit in the 500-line limit should be
given in an appendix. If more appropriate, the full version may be given
as the appendix. In both cases, however, the authors should include in
the main part specific pointers to the relevant locations in the appendix.
The appendix will be read by the program committee members at their
discretion and will not be published as part of the proceedings. Thus,
the paper without the appendix should be able to stand on its own.
Experimental and implementation results (independent of paper type) must
be reproducible and verifiable. Authors of all types of papers are
encouraged to put accompanying software and relevant data, if there are
any, in a repository accessible to the reviewers. Authors are asked to
indicate which of the supporting material will remain publicly available
if their papers are accepted.

Submissions deviating from the above guidelines risk being rejected
without further consideration.

Results previously published or accepted for publication in the
proceedings of another conference cannot be submitted. Simultaneous
submissions of the results to another conference with published
proceedings are not allowed. Exempted are workshops and conferences
without formal proceedings, but possibly with handouts containing short
abstracts. Results that have already been accepted (with or without
revision) for publication in a journal at the time of their submission to
the symposium are not allowed. A paper submitted to a journal but not yet
accepted for publication can be submitted to the symposium. In such
cases, the authors must mention this on the front page of the submission
and clearly identify the status of the journal submission as of November
28, 2018.


*Format of Accepted Papers*

Final proceedings versions of accepted papers must be formatted in
accordance with the LIPIcs proceedings guidelines and not exceed 500
lines, excluding a title page and references. These final versions must
be submitted by March 15, 2019. If any supporting material (including
complete proofs of theoretical claims and experimental details) does not
fit in the specified limit, then the full version of the paper containing
this information must be referenced in the conference version and made
available at a public repository, such as arXiv, by March 15, 2018. Where
applicable, we encourage authors to make accompanying software and/or data
publicly accessible, with proper references in the paper.

An author of each accepted paper will be expected to attend the symposium
and present the paper (approximately 20 minutes). An award will be given
to the best paper, and if it is of interest to a broad audience, its
authors will be invited to submit an extended version of it to the Journal
of the ACM. Authors of a selection of papers from the symposium will be
invited to submit extended versions of their papers to special issues of
Discrete & Computational Geometry and Journal of Computational Geometry.


*Program Committee*

Hee-Kap Ahn, Pohang Univ. of Science and Technology, South Korea
Alexandr Andoni, Columbia University, USA
Sunil Arya, Hong Kong Univ. of Science and Technology, China
Gill Barequet (co-chair), Technion—Israel Inst. of Technology, Israel
Mark de Berg, TU Eindhoven, Netherlands
Prosenjit Bose, Carleton University, Canada
Frédéric Cazals, INRIA Sophia Antipolis-Méditerranée, France
Tamal K. Dey, The Ohio State University, USA
Kyle Fox, Univ. of Texas at Dallas, USA
Joachim Gudmundsson, Univ. of Sydney, Australia
Chaya Keller, Ben Gurion University, Israel
Stephen Kobourov, Univ. of Arizona, USA
Francis Lazarus, CNRS Grenoble, France
Clément Maria, INRIA Sophia Antipolis-Méditerranée, France
Tillmann Miltzow, Utrecht University, Netherlands
Zuzana Patáková, Inst. of Science and Technology, Austria
Amit Patel, Colorado State University, USA
Raimund Seidel, Saarland University, Germany
Christian Sohler, TU Dortmund, Germany, and Google, Switzerland
Noam Solomon, Harvard University, USA
Subhash Suri, Univ. of California at Santa Barbara, USA
Kasturi Varadarajan, Univ. of Iowa, USA
Birgit Vogtenhuber, Graz Univ. of Technology, Austria
Bei Wang, University of Utah, USA
Yusu Wang (co-chair), The Ohio State University, USA


*Paper types*

When writing or evaluating a SoCG paper, it is important to keep in mind
that there are different types of contributions, each with their own
strengths. Results of all kinds (theoretical and practical) need to be
reproducible and verifiable. To ensure that each submission is evaluated
on its own merits, authors need to identify the main strengths of their
submissions, as captured by four possible paper types. These paper types
are described in detail below, together with their associated evaluation
criteria. These criteria will serve as the basis for all reviews, both by
PC members and by external subreviewers, and for the subsequent discussion
in the PC. There are no quotas for the paper types and submissions can be
labeled with more than one paper type at the time of submission.

Mathematical Foundations

A typical paper will contain theorems and proofs describing new results in
discrete or combinatorial geometry, or in topological combinatorics. The
paper will primarily be evaluated on its technical depth, the importance
of the results, the elegance of the solution, the connection of the
problem studied to computational geometry and topology, and the potential
future impact on algorithm development.

Algorithmic Complexity

A typical paper will contain algorithms, data structures, theorems,
proofs, or lower bound constructions describing new results on
computational geometry problems. The paper will primarily be evaluated on
the (mathematical or computational) relevance and importance of the
problem studied, its technical depth, the elegance of the solution, and
the potential future impact of the results or the proposed new methods and
techniques.

Experimental & Implementation

A typical paper will make a clear contribution to the implementation and
evaluation of geometric algorithms, such as exact, approximate, or
algebraic computation, algorithms engineering, or the experimental
evaluation of competing algorithmic approaches. The paper will primarily
be evaluated on the completeness and the expected impact of the proposed
implementation, the soundness of the experiments, the quality and quantity
of testing, and on the general amount of knowledge gained.

Applications

A typical paper will describe the modeling and algorithmic choices made
when developing or adapting computational geometry techniques for an
application area. The paper will be primarily evaluated on the soundness
of the modeling decisions, the ingenuity of the solution, the
effectiveness of the proposed method, and the expected impact in the
application area. One might also consider the lesson learned regarding
the applicability or suitability of computational geometry tools to the
specific area.

**********************************************************
*
* 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 Position in Parameterized Algorithms (deadline extension)

The Algorithms group at the University of Sheffield (UK) is offering a
fully funded 3 year PhD studentship on the development of Parameterized
Algorithms for Problems in Artificial Intelligence and Logic (
https://www.sheffield.ac.uk/dcs/research/groups/algorithms). Parameterized
Complexity is a vastly growing area within theoretical computer science
that allows for the development of exact algorithms for computational hard
problems that exploit the structuredness of real-world instances. The goal
of this project is to develop more efficient parameterized algorithms for a
wide range of problems in computer science such as satisfiability of
propositional formulas, constraint satisfaction, integer linear
programming, as well as problems from graph theory and machine learning
with the help of sophisticated algorithmic techniques such as
meta-theorems, dynamic programming, decompositions, and backdoor sets.

The candidate will be supervised by Dr. Sebastian Ordyniak.

Applicants are expected to have excellent mathematical skills as well as an
interest in discrete algorithms.

Funding Notes:

This fully funded studentship is open to UK or EU students, and provides a
tax-free living allowance at the standard Research Council rate (£14,777
p.a. for 2018/19) and full student tuition fees for three years.

Application:

The application should include the candidate's CV, an abstract of the
diploma/masters thesis, and a short motivation letter (if possible in a
single pdf file). The application should also mention possible starting
dates and should be sent to sordyniak@gmail.com by 15. December 2018. The
PhD project starting date is flexible.

For informal inquiries please contact Dr. Sebastian Ordyniak at
sordyniak@gmail.com.

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

Wednesday, October 17, 2018

[DMANET] Tenure-Track Faculty Positions in Computer Science

Duke University invites applications and nominations for four
tenure-track or tenured faculty positions in all areas of computer
science, and for two additional joint positions between Computer Science
and other departments. Areas include artificial intelligence, machine
learning, computer systems, security and privacy, database systems,
computer vision, algorithms, optimization, as well as interdisciplinary
work that relates to the social sciences or biological sciences.
Positions are at all ranks and to begin July 2019.

Candidates are expected to have a doctoral degree in computer science or
related areas. A successful candidate must have a solid disciplinary
foundation and demonstrate promise of outstanding scholarship in every
regard, including research and teaching.

The Duke faculty and student communities are currently very diverse and
are strongly committed to further enhancing this diversity. We seek
faculty members who are committed to building a diverse and inclusive
community, which fosters excellence in research and teaching. We
strongly encourage applications from women and underrepresented
minorities in computing. Please see www.cs.duke.edu
<http://www.cs.duke.edu/> and www.provost.duke.edu/faculty
<https://provost.duke.edu/faculty-resources/advantages/> for information
about the Department and advantages that Duke offers to faculty.

Applicants should submit their materials (cover letter, research
statement, teaching statement, contacts for at least three references)
electronically through AcademicJobsOnline:
https://academicjobsonline.org/ajo/jobs/12079, and solicit letters of
reference. For full consideration, applications and references should be
received by December 15, 2018.

Duke University is an Affirmative Action/Equal Opportunity Employer
committed to providing employment opportunity without regard to an
individual's age, color, disability, genetic information, gender, gender
identity, national origin, race, religion, sexual orientation, or
veteran status.

Durham, Chapel Hill, and the Research Triangle of North Carolina are
frequently ranked among the best places in the country to live and work.
Duke and the many other universities in the area offer a wealth of
education and employment opportunities for spouses and families.


--
Jennifer Schmidt
Duke University Department of Computer Science
LSRC D315, Box 90129, Durham, NC  27708-0129
Office 919-660-6548
jschmidt@cs.duke.edu <mailto:jschmidt@cs.duke.edu>

**********************************************************
*
* 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] Special issue of EJCO on Bilevel Optimisation - Deadline extended to October 31, 2018

The deadline has been extended to October 31, 201- REMINDER

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

Special issue of the EURO Journal on Computational Optimization on Bilevel Optimization

Bilevel Programming is a fairly recent branch of optimization that deals with programs whose constraints embed an auxiliary optimization problem. Bilevel programs are pervasive and are commonly found in a number of real-world problems. This includes problems in the domains of transportation, energy, economics, decision science, environmental economics, etc. Efficient exact or approximate solution algorithms for such problems must exploit the structure of the problems at hand.

The aim of the special issue is to invite high-quality manuscripts addressing bilevel optimization problems and presenting convincing numerical results.

Possible topics include, but are not restricted to:

• Linear, convex, nonlinear, mixed integer bilevel optimization

• Equilibrium problems

• Stackelberg games

• Energy applications

• Transportation and location applications

• Pricing problems

• Interdiction and fortification problems.

Following the journal high standards, we expect high quality contributions that will undergo the strict reviewing process of EJCO.


Submission deadline is September 30, 2018.


In order to submit a paper for the special issue,


1. Log on the editorial manager using the <Author Login> via the website

https://www.editorialmanager.com/ejco/ <https://www.editorialmanager.com/ejco/>
2. Select <Submit New Manuscript> in the main menu.

3. In the drop down list associated with <Choose Article Type> select the desired special issue

(« SI: Bilevel Optimisation »). Note that all entries corresponding to the special issues start with SI.

We are looking forward to receiving your contributions.


The Guest Editors


Luce Brotcorne, INRIA Lille

Bernard Fortz, Université Libre de Bruxelles and INRIA Lille

Martine Labbé, Université Libre de Bruxelles and INRIA Lille

-------------------------------------------------------
Prof. Martine Labbé
Département d'Informatique, Université Libre de Bruxelles, CP 212
Boulevard du Triomphe, B-1050 Brussels, Belgium
Tel: + 32 (0)2 6503836, Fax: + 32 (0)2 6505970
http://gom.ulb.ac.be/mlabbe/ <http://gom.ulb.ac.be/mlabbe/>
Editor-in-Chief, EURO Journal on Computational Optimization
http://www.springer.com/business+%26+management/operations+research/journal/13675 <http://www.springer.com/business+%26+management/operations+research/journal/13675>
-------------------------------------------------------


**********************************************************
*
* 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 Papers of a Special Issue 'Graph-Theoretic Problems and Their New Applications' in Mathematics

The journal

Mathematics (ISSN 2227-7390, http://www.mdpi.com/journal/mathematics)

is currently running a Special Issue entitled "Graph-Theoretic
Problems and Their New Applications". Mathematics is an international
peer-reviewed open access monthly journal published by MDPI which is
listed e.g. in Scimago (since 2017), Scopus and Web of Science and
tracked for an impact factor 2019.

As the Guest Editor of this issue, I would like to invite you to
submit your latest research in all areas of graph-theoretic problems
and their applications.
For further reading, please follow the link to the Special Issue Website at:

https://www.mdpi.com/journal/mathematics/special_issues/gtptna.

The submission deadline is 31 January 2020. You may send your
manuscript now or up until the deadline. Accepted papers will be
immediately published on the journal website.

All articles in Mathematics (ISSN 2227-7390) are published in full
open access. Authors are asked to pay an article processing charge
(APC) of 350 CHF (Swiss Francs) per accepted paper. The APC only
applies if the article is accepted for publication in Mathematics
after peer-review and possible revision of the manuscript. There are
no submission charges. In addition to Swiss Francs (CHF), they also
accept payment in Euros (EUR), US Dollars (USD) or British Pound
Sterling (GBP).

Submitted papers should be well formatted and use good English.
Authors may use MDPI's English editing service prior to publication or
during author revisions. Note that many national and private research
funding organizations and universities explicitly cover APCs for
articles resulting from funded research projects. Discounts are also
available for authors from institutes which participate in MDPI's
Institutional Open Access Program (IOAP).
Please note that for papers submitted after 31 December 2018 an APC of
850 CHF applies.

Submitted manuscripts should not have been published previously, nor
be under consideration for publication elsewhere (except conference
proceedings papers). All manuscripts are thoroughly refereed through a
single-blind peer-review process. A guide for authors and other
relevant information for submission of manuscripts is available on the
Instructions for Authors page.

Guest Editor:
Frank Werner
Otto-von-Guericke-Universität, Fakultät für Mathematik, Magdeburg, Germany
E-Mail: frank.werner@ovgu.de


--
Frank Werner
OvGU Magdeburg, Fakultät für Mathematik,
PSF 4120, 39016 Magdeburg
email: frank.werner@ovgu.de
http://www.math.uni-magdeburg.de/~werner
Tel.: +49 (0) 391 67 52025

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

Tuesday, October 16, 2018

[DMANET] PhD position University of Twente

*PhD Researcher at University of Twente in the NWO project**
*
´*Self-organising marketplace to realise a self-organised sustainable power system* (AGILE)´
(see also https://www.utwente.nl/en/organization/careers/vacancy/!/414850/phd-position-mathematics-in-decentralized-energy-management )

The Operations Research group of the Department of Applied Mathematics at the University of Twente has a vacancy for a full-time PhD position in the AGILE project. This project has as goal to design self-organising market mechanisms and corresponding distributed software to enable a smart and sustainable energy system.

The candidate of this vacancy will focus on mathematical aspects. In particular, the candidate will work in the general area of stochastic off-line planning and scheduling, on-line dispatching, self-configuration and self-optimisation and will contribute as one of two PhDs to AGILE project, which is a collaboration of University of Twente, Eindhoven University of Technology, and industry partners.
Besides a strong Operations Research and Mathematic background an affinity with engineering and applications would be appreciated. A strong background in power systems engineering is not essential – the other PhD student in the project will focus on those aspects.

Organization

The PhD candidate will be employed at the chair Discrete Mathematics and Mathematical Programming at the University of Twente (see www.utwente.nl/eemcs/dmmp/ and www.utwente.nl/eemcs/energy/ for the energy management related research) but the project is carried out in cooperation with the Stochastics and Power systems engineering groups at Eindhoven University of Technology.

*Contact*

Please apply before November 1, 2018 via the webpage https://www.utwente.nl/en/organization/careers/vacancy/!/414850/phd-position-mathematics-in-decentralized-energy-management

For more information about this position and the project, please contact:
Johann Hurink (j.l.hurink@utwente.nl) or
Bert Zwart (bertz@cwi.nl).

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

Monday, October 15, 2018

[DMANET] Open Faculty Position in Operations Research at ESSEC

*ESSEC Business School is offering a position of Assistant Professor or
Associate Professor in Operations Research for its Paris-Cergy campus, to
start in September 2019*.

Applicants should have a strong research focus and interests in
Mathematical Programming and Discrete Optimization, with a PhD or doctorate
in related fields. They should also demonstrate high leadership and
autonomy in research and teaching, with publications in high-quality
journals in Operations Research. Salary is competitive with the European
Business Schools environment.

The Professor will join the Information Systems, Decision Sciences and
Statistics (IDS) department, and will be part of the OMOR (Operations
Management / Operations Research) research cluster of ESSEC Business School
that currently gathers 9 permanent members and 10 PhD students (see
website *operations-management-research.essec.edu
<http://operations-management-research.essec.edu>* ).

The applicant should be able to teach both in English and French (or
French within
2 years after the appointment), and in various ESSEC Business School
Programs (bachelor, master, PhD, and potentially executive education for
more senior profiles). Research interests and applications concern, but are
not restricted to: prescriptive analytics, data-driven optimization, supply
chain management, sustainable operations, network design, facility
location, transportation and routing, e-commerce and digital business.
Within the Mathematical Programming research field, a particular focus on
decomposition methods for large-scale optimization problems and/or optimization
under uncertainty will be considered as a plus. Ideal profiles combine
innovation spirit, technical depth, and a strong interest in linking theory
and practice through applications.

With its 3 campuses (Paris, Singapore and Rabat), ESSEC Business School is
a top European Business School with international and very diverse faculty
and student communities. The ESSEC Master in Management is ranked #4
worldwide by the Financial Times in 2018, and #4 in The Economist. The
ESSEC Master in Finance is ranked #5 worldwide in the FT. The ESSEC Master
in Data Science & Business Analytics (a joint program with Ecole Centrale
Paris) is ranked #4 worldwide in the latest QS 2018 ranking.

Candidates should send their applications (including a cover letter, a
detailed curriculum vitae, a list of publications emphasizing the four most
representative ones, teaching and research statement and three
recommendation letters) to:

Ms Frédérique Jean-Louis, IDS Department Administrative Assistant

OR-position2019@essec.edu

The closing date for applications is *December 18, 2018. * For further
information on academic matters and Operations Research at ESSEC,
prospective candidates are invited to contact Prof. Laurent Alfandari (
alfandari@essec.edu) and/or Prof. Ivana Ljubic (ljubic@essec.edu), IDS
Professors of Operations Research and Decision Analytics.

**********************************************************
*
* 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] Tenured/Tenured-Track Faculty Position(s), Cornell Tech, New York City, NY

A faculty position in Operations Research and Information Engineering (ORIE) is available at the Cornell Tech campus in New York City. The position is part of the Jacobs Technion-Cornell Institute, and we particularly encourage candidates whose work fits into Jacobs Institute application-domain emphases in the areas of urban technology, especially related to the intersection of digital and physical systems, and digital health technologies.
The position is within Cornell University's School of ORIE, and applicants with research interests represented within Cornell ORIE are welcome at all levels, including tenured and tenure-track. The School consists of a diverse group of high-quality researchers and educators interested in probability, optimization, statistics, simulation, and a wide array of applications such as e-commerce, supply chains, scheduling, manufacturing, transportation systems, health care, financial engineering, service systems and network science. Cornell ORIE spans both the Ithaca and New York City campuses, but the successful candidate's teaching and research will be based in New York City. (Interested candidates can apply for a Cornell Tech in NYC position, a Cornell Ithaca ORIE position, or both, but the two campuses have different application sites; please see the Cornell Ithaca ad for the Ithaca application URL.)
Candidates must hold a Ph.D. in operations research, mathematics, statistics, or a related field by the start of the appointment, and have demonstrated an ability to conduct outstanding research at the level of tenure-track or tenured faculty in Cornell ORIE. They must also have a strong commitment to engagement outside of academia in ways that foster significant commercial or societal impact, as aligned with the mission of the Cornell Tech campus. The Institute seeks candidates with demonstrated transdisciplinary interests and a track record of translational science. The successful candidate will be expected to pursue an active research program, to teach Master's and Ph.D.-level graduate courses, and to supervise graduate students.
All applications completed by November 16, 2018 will receive full consideration, but we urge candidates to submit all required material as soon as possible. We will accept applications until we fill the positions. Applicants should submit a curriculum vitae, brief statements of research and teaching interests, and the names and contact information of at least three references. They should also identify one or two top publications to which they have made significant contributions. A distinguishing characteristic of research at Cornell Tech, in addition to world-class academic work, is that it engages deeply with external communities, organizations, K-12 education, and industry to address real-world problems and contexts that amplify the direct commercial and societal impact of our research. Accordingly, within a clearly identified subsection of the research statement, the candidate should address prior accomplishments and future plans related to this kind of direct commercial and/or societal impact of their research. Applications are on-line at https://academicjobsonline.org/ajo/jobs/12018
Inquiries about your application may be directed to Sheri Minarski at slm339@cornell.edu<mailto:slm339@cornell.edu>.
Diversity and Inclusion are a part of Cornell University's heritage. We are a recognized employer and educator valuing AA/EEO, Protected Veterans, and Individuals with Disabilities.


**********************************************************
*
* 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] Tenured/Tenured-Track Faculty Position(s), Cornell University, Ithaca, NY

Cornell University's School of Operations Research and Information Engineering (ORIE) seeks to fill multiple tenured/tenure-track faculty positions for its Ithaca campus. We will primarily consider applicants with research interests in the areas of discrete optimization and financial engineering, especially those individuals who do computation, who work with data, or whose work intersects with machine learning. Nevertheless, we welcome strong applicants from all research areas represented within ORIE, especially those in resonance with College of Engineering Strategic Areas: https://www.engineering.cornell.edu/research-and-faculty/strategic-areas-research.
Requisite is a strong interest in the broad mission of the School, exceptional potential for leadership in research and education, an ability and willingness to teach at all levels of the program, and a PhD in operations research, mathematics, statistics, or a related field by the start of the appointment. Salary will be appropriate to qualifications and engineering school norms.
Cornell ORIE is a diverse group of high-quality researchers and educators interested in probability, optimization, statistics, machine learning, simulation, and a wide array of applications such as e-commerce, supply chains, scheduling, manufacturing, transportation systems, health care, financial engineering, service systems and network science. We value mathematical and technical depth and innovation, and experience with applications and practice. Ideal candidates will have correspondingly broad training and interests.
Please apply online at https://academicjobsonline.org/ajo/jobs/11870 with a cover letter, CV, statements of teaching and research interests, sample publications, at least three reference letters and, for junior applicants, a doctoral transcript. All applications completed by November 16, 2018 will receive full consideration, but we urge candidates to submit all required material as soon as possible. We will accept applications until we fill the positions.
ORIE and the College of Engineering at Cornell embrace diversity and seek candidates who can contribute to a welcoming climate for students of all races and genders. Cornell University seeks to meet the needs of dual career couples, has a Dual Career program, and is a member of the Upstate New York Higher Education Recruitment Consortium to assist with dual career searches. Visit www.unyherc.org/home<http://www.unyherc.org/home/> to see positions available in higher education in the upstate New York area. Diversity and Inclusion are a part of Cornell's heritage. We are a recognized employer and educator valuing AA/EEO, Protected Veterans, and Individuals with Disabilities. We strongly encourage qualified women and minority candidates to apply.


**********************************************************
*
* 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] Computational Optimization

Call for Papers

11th International Workshop on Computational Optimization (WCO19)
Leipzig, Germany, September 1-4, 2019

organized in the framework of FEDERATED CONFERENCE ON COMPUTER SCIENCE
AND INFORMATION SYSTEMS
FedCSIS - 2019

IEEE CS is a technical co-sponsor of FedCSIS 2019

https://fedcsis.org/2019/wco

===============================

We invite original contributions related to both theoretical and
practical aspects of optimization methods. The list of topics
includes, but is not limited to:

* combinatorial and continuous global optimization
* unconstrained and constrained optimization
* multiobjective and robust optimization
* optimization in dynamic and/or noisy environments
* optimization on graphs
* large-scale optimization, in parallel and distributed computational
environments
* meta-heuristics for optimization, nature-inspired approaches and any
other derivative-free methods
* exact/heuristic hybrid methods, involving natural computing
techniques and other global and local optimization methods
*numerical and heuristic methods for modeling

The applications of interest are included in the list below, but are
not limited to:

* classical operational research problems (knapsack, traveling salesman, etc)
* computational biology and distance geometry
* data mining and knowledge discovery
* human motion simulations; crowd simulations
* industrial applications
* optimization in statistics, econometrics, finance, physics,
chemistry, biology, medicine, and engineering.
*environment modeling and optimization
===============================

Best paper award

The best WCO18 paper will be awarded during the social dinner of FedCSIS2018.
The best paper will be selected by WCO19 co-Chairs by taking into
consideration the scores suggested by the reviewers, as well as the
quality of the given oral presentation.

===============================

Submission and Publication

* Authors should submit draft papers in PDF format.
* The total length of a paper should not exceed 10 pages for regular
paper and 4 pages for short papers (IEEE style). IEEE style templates
are available at http://www.fedcsis.org/.
* Papers will be refereed and accepted on the basis of their
scientific merit and relevance to the workshop.
* Accepted and presented papers will be published in the Conference
Proceedings and included in the IEEE Xplore database and submitted for
different indexations (Communication and Position papers will only
appear in the conference proceedings).
* Extended versions of selected papers presented at WCO18 will be
published in edited books of the series "Studies of Computational
Intelligence", Springer.

===============================

Important dates:

Paper submission (sharp / no extensions) : May 14th, 2019
Position paper submission : June 4th, 2019
Author notification : June 25th, 2019
Final paper submission and registration : July 10, 2019
Conference date : September 1-4, 2019

===============================

Organizing Committee

Stefka Fidanova, Bulgarian Academy of Science, Bulgaria
Antonio Mucherino, IRISA, University of Rennes 1, France
Daniela Zaharie, West University of Timisoara, Romania

If you have any question do not hesitate to send an email to :
wco2019@fedcsis.org

===============================

--
Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
**********************************************************
*
* 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] metaheuristics for large scale problems

Dear Colleague,

On behalf of the Organizing Committee, we invite you to participate in
the special session (workshop) on "APPLICATIONS OF METAHEURISTICS TO
LARGE-SCALE PROBLEMS" at the 12th International Conference on Large
Scale Scientific Computation - LSSC'19, June 10 - 14, 2019, Sozopol,
Bulgaria, with arrival: June 9 and departure: noon June 14.

The session is organized by:
Prof. Stefka Fidanova (stefka@parallel.bas.bg)
from the Institute of Information and Communication Technologies
(former Institute for Parallel Processing), Bulgarian Academy of
Sciences and
Gabriel Luque (gabriel@lcc.uma.es) from University of Malaga, Spain.

Topics

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

combinatorial optimization
global optimization
multiobjective optimization
optimization in dynamic and/or noisy environments
large scale optimization
parallel and distributed approaches in optimization
random search algorithms,
simulated annealing,
tabu search
other derivative free optimization methods
nature inspired optimization methods (evolutionary algorithms, ant
colony optimization, particle swarm optimization, immune artificial
systems etc)
hybrid optimization algorithms involving natural computing
techniques and other global and local optimization methods
optimization methods for learning processes and data mining
computational optimization methods in statistics, econometrics,
finance, physics, medicine, biology, engineering etc

Proceedings
We plan to continue publishing the proceedings of only refereed and
presented papers as a special volume of Springer Lecture Notes in
Computer Science (LNCS).

Important deadlines
Deadline for submission of abstracts
January 15, 2019
Notification of acceptance of the talks on the basis of the
submitted abstract
January 31, 2019
Deadline for registration
February 15, 2019
Deadline for submission of full papers
March 01, 2019
Notification of acceptance of full papers
April 15, 2019


Abstracts and contributed papers
The abstracts (up to 1 page stating clearly the originality of the
results) are to be written in standard LaTeX. The length of the
contributed papers is limited up to 8 pages. It is assumed that one
participant will present not more than one talk.

Send the abstracts and papers to special session organizers and
conference organizers, indicating the name of the special session.
After sending the abstract go to the conference web page and fill in
the registration form (personal data of the participants, minimum one
per paper, and the name of the special session).

Information about abstract and paper preparation, accommodation,
transportation, registration form and conference location you can find
at the conference web page
http://parallel.bas.bg/Conferences/SciCom19/


Special session organizers
Prof. Stefka Fidanova
Prof. Gabriel Luque

--
Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
**********************************************************
*
* 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] Postdoc positions in algorithms at the University of Vienna, AT

Two postdoc positions (20h per week, each) are available at the
University of Vienna in the research group Theory and Applications of
Algorithms led by Professor Monika Henzinger. For more information on
the research group, please see the website: https://taa.cs.univie.ac.at/.

The positions are available starting 01 December 2018 (or later) and
will last for 3 years.

For more details, please see the entry in the JobCenter of the
University of Vienna with the identifier 8977:
https://jobcenter.univie.ac.at.

If you are interested, please send your application EITHER by submitting
it to the JobCenter of the University of Vienna (identifier 8977) OR by
sending an email to taa.jobs@cs.univie.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/
*
**********************************************************

Sunday, October 14, 2018

IRIF Annual Postdoc Call (opens October - deadline mid-November)

IRIF (CNRS / U. Paris Diderot), Paris, France, is seeking excellent candidates for about 10 postdoctoral positions in all areas of the Foundations of Computer Science.

IRIF (Institute for Research in Foundations of Computer Science) is a joint laboratory of the CNRS (French National Center for Scientific Research) and Université Paris Diderot created in 2016 as the merger of the previous laboratories LIAFA and PPS. Research in IRIF spans areas such as the design and analysis of algorithms, complexity, combinatorics, quantum computing, networks and complex systems and distributed computation, theory and algorithms of graphs, automata theory and applications, systems modeling and verification, foundations of programming languages, interactive proof assistance systems, computational formalisms. For further information about IRIF please see https://www.irif.fr/en/informations/presentation

The positions are financed either by the laboratory resources, group or personal grants, or by joint applications of IRIF members and the candidate to outside funding agencies. The starting date of the positions will be in the course of 2019, usually around September-October but that can depend on the financial support. For this call, the application deadline is November 15, 2018, but late applications might be considered for future calls or in case of unfilled positions.

Candidate must hold a Ph.D. degree before the start date of position. Knowledge of French is not required, and applications can be sent either in French or in English. It is recommended, prior to applying, to contact one or more of the permanent members of IRIF, those closest to the potential candidate's area, in order to get more information.

To apply to the positions, please visit https://www.irif.fr/en/postes/postdoc

Saturday, October 13, 2018

PhD position in SAT solving at KTH Royal Institute of Technology

The TCS Group at KTH Royal Institute of Technology invites applications for a PhD position in CS focusing on algorithms for solving the Boolean satisfiability problem (SAT) very efficiently for large classes of instances, and on analyzing and understanding such algorithms. To receive full consideration your application should be submitted via http://www.csc.kth.se/~jakobn/openings/J-2018-2101-Eng.php by the deadline October 31, 2018, but candidates will be reviewed continuously and early applications are strongly encouraged.

 

This is a position within the Wallenberg Artificial Intelligence, Autonomous Systems and Software Program WASP (http://wasp-sweden.org/), Sweden's largest ever individual research program and a major national initiative for strategically motivated basic research, education and faculty recruitment. The PhD student will be part of the WASP AI-Math Graduate School, providing a valuable network with other researchers within WASP and presenting unique opportunities for students who are dedicated to achieving international research excellence with industrial relevance.

 

The TCS Group (http://www.kth.se/tcs) at KTH offers a strong research environment spanning a wide range of research topics such as theory of computation, computer and network security, cryptography, software engineering, formal methods and natural language processing. We have one of Europe's most prominent groups in algorithms and complexity theory, and the research conducted here has attracted numerous international awards and grants in recent years.

 

The PhD student will be working in the research group of Jakob Nordstrom (http://www.csc.kth.se/~jakobn/), which currently consists of 4 postdoctoral researchers and 4 PhD students in addition to the PI. There are also several other professors, postdocs, and PhD students in the TCS Group working on other aspects of algorithms and computational complexity, and so this is an excellent opportunity to explore new connections between theoretical and practical areas of computer science within a vibrant and growing research environment.

 

This is a four-year full-time employed position, but PhD positions usually (though not necessarily) include 20% teaching, in which case they are prolonged for one more year. The successful candidate would ideally start sometime as early as possible in 2019, though this is negotiable. The position is fully funded and comes with a competitive salary.

 

See http://www.csc.kth.se/~jakobn/openings/J-2018-2101-Eng.php for the full announcement with more information and instructions how to apply. Informal enquiries are welcome and may be sent to jakobn@kth.se .


[DMANET] PhD position in SAT solving at KTH Royal Institute of Technology

The TCS Group at KTH Royal Institute of Technology invites applications for a PhD position in CS focusing on algorithms for solving the Boolean satisfiability problem (SAT) very efficiently for large classes of instances, and on analyzing and understanding such algorithms. To receive full consideration your application should be submitted via http://www.csc.kth.se/~jakobn/openings/J-2018-2101-Eng.php by the deadline October 31, 2018, but candidates will be reviewed continuously and early applications are strongly encouraged.

This is a position within the Wallenberg Artificial Intelligence, Autonomous Systems and Software Program WASP (http://wasp-sweden.org/), Sweden's largest ever individual research program and a major national initiative for strategically motivated basic research, education and faculty recruitment. The PhD student will be part of the WASP AI-Math Graduate School, providing a valuable network with other researchers within WASP and presenting unique opportunities for students who are dedicated to achieving international research excellence with industrial relevance.

The TCS Group (http://www.kth.se/tcs) at KTH offers a strong research environment spanning a wide range of research topics such as theory of computation, computer and network security, cryptography, software engineering, formal methods and natural language processing. We have one of Europe's most prominent groups in algorithms and complexity theory, and the research conducted here has attracted numerous international awards and grants in recent years.

The PhD student will be working in the research group of Jakob Nordstrom (http://www.csc.kth.se/~jakobn/), which currently consists of 4 postdoctoral researchers and 4 PhD students in addition to the PI. There are also several other professors, postdocs, and PhD students in the TCS Group working on other aspects of algorithms and computational complexity, and so this is an excellent opportunity to explore new connections between theoretical and practical areas of computer science within a vibrant and growing research environment.

This is a four-year full-time employed position, but PhD positions usually (though not necessarily) include 20% teaching, in which case they are prolonged for one more year. The successful candidate would ideally start sometime as early as possible in 2019, though this is negotiable. The position is fully funded and comes with a competitive salary.

See http://www.csc.kth.se/~jakobn/openings/J-2018-2101-Eng.php for the full announcement with more information and instructions how to apply. Informal enquiries are welcome and may be sent to jakobn@kth.se .


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