dmanet@zpr.uni-koeln.de
To subscribe or unsubscribe via the World Wide Web, visit
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
or, via email, send a message with subject or body 'help' to
dmanet-request@zpr.uni-koeln.de
You can reach the person managing the list at
dmanet-owner@zpr.uni-koeln.de
When replying, please edit your Subject line so it is more specific
than "Re: Contents of dmanet digest..."
Today's Topics:
1. SAT 2016 CFP (Jakob Nordström)
2. Call for Participation: Session on "Green Urban Logistics" at
EURO 2016 (Nolz Pamela)
3. MSRI-IMUS School on Mixed Integer Nonlinear Programming
(Elena Fernandez)
4. 1st IMA Conference on Theoretical and Computational Discrete
Mathematics - early bird fees until 22 February 2016 (Pam Bye)
----------------------------------------------------------------------
Message: 1
Date: Fri, 15 Jan 2016 07:13:13 +0000
From: Jakob Nordström <jakobn@kth.se>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] SAT 2016 CFP
Message-ID: <1452841991243.46175@kth.se>
Content-Type: text/plain; charset="iso-8859-1"
CALL FOR PAPERS
Nineteenth International Conference on
THEORY AND APPLICATIONS OF SATISFIABILITY TESTING
--- SAT 2016 ---
Bordeaux, France, July 5-8, 2016
Abstract submission deadline: February 14, 2016
Paper submission deadline: February 21, 2016
-----------------------------------------------------------------------
The International Conference on Theory and Applications of
Satisfiability Testing (SAT) is the premier annual meeting for
researchers focusing on the theory and applications of the propositional
satisfiability problem, broadly construed. In addition to plain
propositional satisfiability, it also includes Boolean optimization
(such as MaxSAT and Pseudo-Boolean (PB) constraints), Quantified Boolean
Formulas (QBF), Satisfiability Modulo Theories (SMT), and Constraint
Programming (CP) for problems with clear connections to Boolean-level
reasoning.
Many hard combinatorial problems can be tackled using SAT-based
techniques including problems that arise in Formal Verification,
Artificial Intelligence, Operations Research, Computational Biology,
Cryptography, Data Mining, Machine Learning, Mathematics, et cetera.
Indeed, the theoretical and practical advances in SAT research over the
past twenty years have contributed to making SAT technology an
indispensable tool in a variety of domains.
SAT 2016 aims to further advance the field by soliciting original
theoretical and practical contributions in these areas with a clear
connection to Satisfiability. Specifically, SAT 2016 invites scientific
contributions addressing different aspects of SAT interpreted in a broad
sense, including (but not restricted to) theoretical advances (such as
exact algorithms, proof complexity, and other complexity issues),
practical search algorithms, knowledge compilation, implementation-level
details of SAT solvers and SAT-based systems, problem encodings and
reformulations, applications (including both novel application domains
and improvements to existing approaches), as well as case studies and
reports on findings based on rigorous experimentation.
SAT 2016 takes place in the nice city of Bordeaux, which is located in
the South West of France. Bordeaux is well-known to be the world wine
capital, and also ranked UNESCO town.
INVITED SPEAKERS
================
We are honored to announce the following invited speakers at SAT'16:
- Phokion Kolaitis, Santa Cruz, USA
- David Monniaux, Grenoble, France
- Torsten Schaub, Potsdam, Germany (ECCAI-sponsored invited talk)
AFFILIATED EVENTS
=================
Competitive Events
------------------
As in previous years, the SAT conference hosts several competitive
events which run before the conference and whose results are disclosed
during the conference.
This year, the following competitive events will be organized:
- [SAT competition](http://baldur.iti.kit.edu/sat-competition-2016/)
- [MAXSAT evaluation](http://www.maxsat.udl.cat)
- [QBF evaluation](http://www.qbflib.org/qbfeval16.php)
- [PB Competition](http://www.cril.univ-artois.fr/PB16/)
Workshops
---------
The day before the conference, Monday July 4th, will be a workshop day.
For the moment, the workshops having been organized for a while with the
SAT conference has been reconducted this year.
- [Seventh Pragmatics of SAT international
workshop](http://www.pragmaticsofsat.org/2016/)
- [International Workshop on Quantified Boolean Formulas
(QBF'16)](http://www.satlive.org/2015/12/22/qbf16.html)
People interested in organizing a workshop that day, for a full day or
half a day, can submit their proposal to sat2016@easychair.org before
February 14 including:
- the topic and context of the workshop
- the organizers, if possible a program committee
- the expected audience size
- the format (invited talks, original contributions)
- any specific requirements
SAT/SMT/AR summer school
------------------------
Since 2011, a SAT/SMT summer school is organized each year to train
students on recent topics of SAT and Satisfiability Modulo Theory.
This year, the SAT/SMT summer school joins forces with the automated
reasoning community to propose a SAT/SMT/AR summer school right before
IJCAR.
The summer school will take place from June 22 to June 25 in Lisbon,
Portugal. IJCAR is taking place in Coimbra, Portugal, from June 27 to
July 2.
More information can be found on the [summer school web
site](http://ssa-school-2016.it.uu.se).
IMPORTANT DATES
===============
- February 14, 2016: Abstract submission deadline
- February 21, 2016: Paper submission deadline
- March 21-23, 2016: Author response period
- April 3, 2016: Author notification
- April 23, 2016: Camera-ready versions of papers due
- July 4, 2016: Pre-conference workshops
- July 5-8, 2016: Main conference
Follow us on the [conference web site](http://sat2016.labri.fr/),
[twitter](http://twitter.com/sat2016bordeaux) or
[facebook](http://www.facebook.com/sat2016bordeaux/) for updates.
SCOPE
=====
SAT 2016 welcomes scientific contributions addressing different aspects
of the satisfiability problem, interpreted in a broad sense. Domains
include MaxSAT and Pseudo-Boolean (PB) constraints, Quantified Boolean
Formulae (QBF), Satisfiability Modulo Theories (SMT), as well as
Constraint Satisfaction Problems (CSP). Topics include, but are not
restricted to:
- Theoretical advances (including exact algorithms, proof complexity,
and other complexity issues);
- Practical search algorithms;
- Knowledge compilation;
- Implementation-level details of SAT solving tools and SAT-based
systems;
- Problem encodings and reformulations;
- Applications (including both novel applications domains and
improvements to existing approaches);
- Case studies and reports on insightful findings based on rigorous
experimentation.
OUT OF SCOPE
============
Papers claiming to resolve a major long-standing open theoretical
question in Mathematics or Computer Science (such as those for which a
[Millennium Prize is
offered](http://www.claymath.org/millennium-problems), are outside the
scope of the conference because there is insufficient time in the
schedule to referee such papers; instead, such papers should be
submitted to an appropriate technical journal.
PAPER CATEGORIES
================
Submissions to SAT 2016 are solicited in three paper categories,
describing original contributions.
- LONG PAPERS (9 to 15 pages, excluding references)
- SHORT PAPERS (up to 8 pages, excluding references)
- TOOL PAPERS (up to 6 pages, excluding references)
LONG and SHORT papers should contain original research, with sufficient
detail to assess the merits and relevance of the contribution. For
papers reporting experimental results, authors are strongly encouraged
to make their data and implementations available with their submission.
Submissions reporting on case studies are also encouraged, and should
describe details, weaknesses, and strengths in sufficient depth. LONG
papers and SHORT papers will be evaluated with the same quality
standards, and are expected to contain a similar contribution per page
ratio.
The authors should choose between a LONG or a SHORT paper depending on
the space they need to fully describe their contribution. The
classification between LONG and SHORT papers is mainly a way to balance
the workload of the reviewing process among PC members. It also impacts
the duration of the presentation of the work during the conference. It
is the responsibility of the authors to make sure that their paper is
self-contained in the chosen limit of pages. There will be no
requalification of the submissions by the PC.
TOOLS papers must obey to a specific content criteria in addition to
their size limit. A tool paper should describe the implemented tool and
its novel features. Here "tools" are interpreted in a broad sense,
including descriptions of implemented solvers, preprocessors, etc., as
well as systems that exploit SAT solvers or their extensions to solve
interesting problem domains. A demonstration is expected to accompany a
tool presentation. Papers describing tools that have already been
presented previously are expected to contain significant and clear
enhancements to the tool.
Submissions should not be under review elsewhere nor be submitted
elsewhere while under review for SAT 2016, and should not consist of
previously published material.
Submissions not consistent with the above guidelines may be returned
without review.
Besides the paper itself, authors may submit a supplement consisting of
one file in the format of a gzipped tarball (.tar.gz or .tgz) or a
gzipped file (.gz) or a zip archive (.zip). Authors are encouraged to
submit a supplement when it will help reviewers evaluate the paper.
Supplements will be treated with the same degree of confidentiality as
the paper itself. For example, the supplement might contain detailed
proofs, examples, software, detailed experimental data, or other
material related to the submission. Individual reviewers may or may not
consult the supplementary material; the paper itself should be
self-contained.
Long and short papers may be considered for a best paper award. If the
main author is a student, both in terms of work and writing, the paper
may be considered for a best student-paper award. Use the supplement to
your submission to state (in a brief cover letter) if the paper
qualifies as a student paper.
Links to information on the Springer LNCS style are available through
the [SAT 2016 website](http://sat2016.labri.fr/).
All papers submissions are done exclusively via
[EasyChair](http://www.easychair.org/conferences/?conf=sat2016).
One author of each accepted paper is expected to present it at the
conference.
PROCEEDINGS
===========
All accepted papers are expected to be published in the proceedings of
the conference, which will be published within the Springer LNCS series.
STUDENT GRANTS
==============
A limited number of student travel support grants will be available from
our sponsors. Applicants should acquire a letter of support from their
advisor and prepare a statement detailing why the travel support is
needed. This information should be emailed to the SAT'16 conference
chairs at sat2016@easychair.org by March 31st, 2016. Determinations will
be made shortly after the notification to the authors.
ORGANIZATION
============
PROGRAM CHAIRS
--------------
- Nadia Creignou Aix-Marseille Université, LIF-CNRS France
- Daniel Le Berre Université d'Artois, CRIL-CNRS France
LOCAL CHAIR
-----------
- Laurent Simon Bordeaux INP, University of Bordeaux, LaBRI-CNRS,
France
PROGRAM COMMITTEE
-----------------
- Fahiem Bacchus University of Toronto
- Yael Ben-Haim IBM Research
- Olaf Beyersdorff University of Leeds
- Armin Biere Johannes Kepler University
- Nikolaj Bjorner Microsoft Research
- Maria Luisa Bonet Universitat Politecnica de Catalunya
- Sam Buss UCSD
- Nadia Creignou Aix-Marseille Université, LIF-CNRS
- Uwe Egly TU Wien
- John Franco University of Cincinnati
- Djamal Habet Aix-Marseille Université, LSIS-CNRS
- Marijn Heule The University of Texas at Austin
- Holger Hoos University of British Columbia
- Frank Hutter University of Freiburg
- Mikolas Janota Microsoft Research
- Matti Järvisalo University of Helsinki
- Hans Kleine Büning University of Paderborn
- Daniel Le Berre Université d'Artois, CRIL-CNRS
- Ines Lynce INESC-ID/IST, University of Lisbon
- Marco Maratea DIBRIS, University of Genova
- Joao Marques-Silva Faculty of Science, University of Lisbon
- Stefan Mengel CRIL-CNRS
- Alexander Nadel Intel
- Nina Narodytska Samsung Research America
- Jakob Nordström KTH Royal Institute of Technology
- Albert Oliveras Technical University of Catalonia
- Roberto Sebastiani DISI, University of Trento
- Martina Seidl Johannes Kepler University Linz
- Yuping Shen Institute of Logic and Cognition, Sun Yat-sen University
- Laurent Simon Bordeaux INP, University of Bordeaux, LaBRI-CNRS
- Takehide Soh Information Science and Technology Center, Kobe University
- Stefan Szeider TU Wien
- Allen Van Gelder University of California, Santa Cruz
CONTACT
=======
k
------------------------------
Message: 2
Date: Fri, 15 Jan 2016 08:28:14 +0000
From: Nolz Pamela <Pamela.Nolz@ait.ac.at>
To: "DMANET@zpr.uni-koeln.de" <DMANET@zpr.uni-koeln.de>
Subject: [DMANET] Call for Participation: Session on "Green Urban
Logistics" at EURO 2016
Message-ID:
<414873E66E768240AE0844B802443F230DC5C6CF@S0MSMAIL112.arc.local>
Content-Type: text/plain; charset="us-ascii"
**********************************************************************
Dear colleagues,
We are kindly inviting you to submit an abstract to session "Green Urban Logistics" at the 28th European Conference on Operational Research (EURO XXVIII), Poznan University of Technology, Poznan, Poland, July 3-6, 2016, http://www.euro2016.poznan.pl/
Green Urban Logistics
Urban logistics has emerged in the last decade as an important concern for many local authorities, cities, freight carriers, logistics service providers, retailers, and citizens. Several forms of organizations for distribution and transportation have been proposed and experimented. These organizations should also consider the three pillars of sustainable development (economic, environmental and societal). For the Operational Research community, new challenges in terms of modeling and solution approaches appear in order to answer the new needs for urban logistics. The authors are invited to submit an abstract addressing Green Urban Logistics. This includes, but is not limited to: vehicle routing for city logistics, multi-echelon vehicle routing problems, urban transportation, electrical vehicle routing problems, carbon emission constraints, the way sustainability can be better integrated into decisions, etc.
**********************************************************************
In order to submit an abstract, please go to https://www.euro-online.org/conf/euro28 and use the invitation code: 18ddcb30
**********************************************************************
Abstracts: max. 1500 characters; submission deadline: March 1, 2016.
**********************************************************************
Kind regards,
Pamela Nolz (pamela.nolz@ait.ac.at<mailto:pamela.nolz@ait.ac.at>) and Nabil Absi (absi@emse.fr<mailto:absi@emse.fr>)
------------------------------
Message: 3
Date: Fri, 15 Jan 2016 11:24:42 +0100
From: Elena Fernandez <e.fernandez@upc.edu>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] MSRI-IMUS School on Mixed Integer Nonlinear
Programming
Message-ID: <5698C8EA.5080201@upc.edu>
Content-Type: text/plain; charset=UTF-8; format=flowed
SUMMER GRADUATE SCHOOL IMUS- MSRI-2016
Mixed Integer Nonlinear Programming: Theory, algorithms and applications
Seville (Spain), June 20th- July 1st, 2016.
This school is an exceptional event that will take place once and it is
oriented to the presentation of theory, algorithms and applications for
the solution of mixed integer nonlinear problems (MINLP). Its goal is to
present, in a unified way, the current theory together with the more
recent algorithms designed to address some families of problems; we will
also introduce the participants to the use of specific solvers devoted
to formulate and to solve instances of these problems. The lecturers
will start with basic concepts, in order to be interesting for
beginners, finalizing discussing advanced topics of this emerging area
of mathematical optimization.
The school is intended for PhD students and young researchers (a maximum
of 30) who wish to advance knowledge or to gain expertise in this
specific field. MSRI and the local organizers will select a number of
candidates (between 20-25) that will receive a grant to support their
expenses to attend the school. The registration deadline is February
20th, 2016.
Lecturers:
- Jeff Linderoth, University of Wisconsin-Madison, USA.
- Robert Weismantel, ETH Zurich, Switzerland.
The program activities is organized in two lectures taught in the
mornings and complementary sessions in the afternoons.
1. Lectures:
- The Theory of Mixed Integer Non-linear Programming. (Robert
Weismantel, ETH Zurich, Switzerland.)
- Modeling aspects and applications of Mixed Integer Non-linear
programming. (Jeff Linderoth, University of Wisconsin-Madison, USA.)
2. Complement to lectures:
- Problem solving and applications sessions will be organized
during the afternoon, and led by the TAs. These sessions will be devoted
to working on problem sets, on real life applications, and on various
projects developed by the students. Lab sessions with available MINLP
solvers will also be included.
- A cornerstone of the program is having students' presentations
about basic topics in the field. This allows students, even those with a
more limited background, to work with source materials, and to practice
lecturing about what they learn. We will ask students to prepare short
(25-30 minute) talks on research papers of their choice. We will guide
them in the preparation of their talk, as well as provide constructive
criticisms of their presentation.
The Course will be held at IMUS, the Institute of Mathematics of the
University of Seville, from June 20th till July 1st, 2016
(http://www.imus.us.es/IMUS-MSRI2016/es/ ) and will be co-organized by
the MSRI (Berkeley), the IMUS Universidad de Sevilla and it is partially
supported by EURO. The course has been approved by the MRSI board and
additional information is available at
http://www.msri.org/summer_schools/773 .
Local Organizers:
- Franscisco J. Castro, Universidad de Sevilla, Spain.
- Elena Fernández, Universitat Politècnica de Catalunya-BcnTech, Spain.
- Justo Puerto, Universidad de Sevilla, Spain.
------------------------------
Message: 4
Date: Fri, 15 Jan 2016 11:47:42 +0000
From: Pam Bye <Pam.Bye@ima.org.uk>
To: "'dmanet@zpr.uni-koeln.de'" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] 1st IMA Conference on Theoretical and Computational
Discrete Mathematics - early bird fees until 22 February 2016
Message-ID: <0B5D256416F8FC449031F8AD6085DBB1B07D2E@ima2k8>
Content-Type: text/plain; charset="iso-8859-1"
1st IMA Conference on Theoretical and Computational Discrete Mathematics
Tuesday 22 - Wednesday 23 March 2016, The Enterprise Centre, University of Derby
Discrete mathematics is a branch of the mathematical sciences which poses a wide range of challenging research problems and gives rise to important applications in other fields such as computer science, engineering, industry, business, finance and the physical/biological sciences. It is a dynamic subject in which techniques, theories and algorithms are drawn from many different areas, and it offers a diverse and stimulating environment for those whose work lies within it. This is a new area for IMA Conferences that the IMA is pleased to support.
The conference will showcase theoretical and computational advances in the general field of discrete mathematics. It is open to researchers working with mathematical structures and abstract constructs, and to those involved in the theory and practise of discrete algorithmic computing. Results which establish links between different areas of discrete mathematics are welcomed, as are applications and the development of new tools. The purpose of this event is to highlight progress in the field through the development of novel theories, methodologies, and applications accordingly, and to inspire future work.
Extended abstracts were solicited from areas including, but not limited to, the following:
· Graph Theory
· Network Visualisation
· Combinatorics (Algebraic, Analytic, Enumerative, Extremal, Probabilistic, Geometric, Algorithmic)
· Number Theory
· Discrete Probability
· Matroid Theory
· Cryptography
· Computer Science
· Large-Scale Networks
· Ordered Sets and Permutations
· Designs
· Topology
· Information Processing
· Discrete Mathematics of Data Mining
· Optimization (Discrete, Combinatorial)
· Theory and Applications of Sequences
· Operations Research and Analytics.
The submissions deadline has now passed. Participants will have the opportunity to submit extended abstracts (3-6 pages in length) for publication in a special conference issue of the online journal 'Electronic Notes in Discrete Mathematics' (Elsevier). Please note that the publication of an extended abstract will NOT restrict the author(s) from publishing a full-length article on the same topic, and with the same title, in another journal (possibly with another publisher) provided that the original publication is sufficiently enhanced (i.e. approximately doubled in size). The required LaTeX-style package and template can be found at:
http://www.elsevier.com/inca/publications/misc/endm_package.zip. More specific instructions relating to online submission will be released closer to the event.
Such a meeting aims to assemble prominent and emerging researchers in discrete mathematics to present new findings and gain a broader snapshot of activity. It is proposed to have both plenary/invited talks and contributed talks. We welcome the participation of graduate students and early career mathematicians, as well as more established academics. The conference seeks to bring together colleagues from the many different arenas where discrete mathematics is developed and applied, and hopes to both encourage and foster personal collaborations as a result.
Invited Speakers
Tuesday 22 March:
Professor Ernesto Estrada (Department of Mathematics and Statistics, University of Strathclyde, U.K)
Matrix Functions for the Analysis of Large-Scale Networks
Professor Dorin Andrica (Faculty of Mathematics and Computer Science, Babes-Bolyai University, Romania)
>From a Result in Analysis to Some Hard Problems in Combinatorial Number Theory
Wednesday 23 March:
Professor Vadim Lozin (Centre For Discrete Mathematics and its Applications, Mathematics Institute, University of Warwick, U.K)
Breaking the Boundaries: From Structure to Algorithms
Dr. Eric J. Fennessey (B.A.E. Systems Surface Ships Limited, H.M. Naval Base, Portsmouth, U.K.)
Statistical Problems in Discrete Event Simulation
Conference Fees
Early Bird Fees*
IMA Member £220
Non-IMA Member £290
IMA Student £150
Non-IMA Student £160
Early Bird Fees* will be available until Monday 22 February 2016, after which the fees will be:
IMA Member £240
Non-IMA Member £310
IMA Student £170
Non-IMA Student £180
*Early Bird Fees must be paid by Monday 22 February 2016 otherwise the higher price will be implemented.
Conference fees include refreshments and lunches throughout the conference, facilities hire and a drinks reception on evening of Tuesday 22 March. To register, please download, complete and return the application form available on the conference webpage: http://tinyurl.com/IMA-DiscreteMaths
A list of suggested hotels is also available on the conference webpage.
Organising Committee
Professor Peter J. Larcombe (University of Derby) = Chair
Dr. David B. Penman (University of Essex) = Co-Chair
Dr. Ovidiu D. Bagdasar (University of Derby)
Dr. Richard Conniss (University of Derby)
Dr. A. Frazer Jarvis (University of Sheffield)
Dr. Nicholas Korpelainen (University of Derby)
Professor Fionn Murtagh (University of Derby)
Dr. Marcello W. Trovati (University of Derby)
Further information
Conference webpage: http://tinyurl.com/IMA-DiscreteMaths
For technical or informal queries, please contact Peter Larcombe, Conference Chair: p.j.larcombe@derby.ac.uk<mailto:p.j.larcombe@derby.ac.uk>
To register your interest, or for conference queries, please contact the IMA Conferences Department: e-mail: conferences@ima.org.uk<mailto:conferences@ima.org.uk>, tel: +44 (0) 1702 354020, fax: +44 (0) 1702 354 111, Institute of Mathematics and its Applications, Catherine Richards House, 16 Nelson Street, Southend-on-Sea, Essex SS1 1EF, UK.
Pamela Bye
Conference Support Officer
Institute of Mathematics and its Applications
Tel: 01702 354020
Charity Registration number 1017777
______________________________________________________________________
The Institute of Mathematics and its Applications is a not for profit organisation registered as a charity in the UK.
This email has been scanned by the MessageLabs Email Security System before onward transmission.
For more information please visit http://www.symanteccloud.com
______________________________________________________________________
------------------------------
Subject: Digest Footer
_______________________________________________
dmanet mailing list
dmanet@zpr.uni-koeln.de
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
------------------------------
End of dmanet Digest, Vol 95, Issue 14
**************************************
No comments:
Post a Comment