Call for Papers:
Stream on "Combinatorial and Global Optimisation: Exact and Heuristic Approaches".
61st Annual Conference of the UK Operational Research Society (OR61)
September 3-5, 2019, University of Kent, Canterbury, UK.
This stream is concerned with all aspects of combinatorial and global optimisation, including applications, theory, algorithms and software. We welcome submissions on exact methods (branch-and-cut, branch-and-price, etc.), heuristic approaches (simulating annealing, tabu search, genetic algorithms, etc.), and other approaches (such as approximation algorithms, matheuristics and hyper-heuristics) as well as studies exploring the interplay between data science and optimisation. Moreover, in addition to traditional OR applications (routing, scheduling, timetabling, etc.), we welcome novel applications such as advanced manufacturing, smart products, bioinformatics and computational biology.
If you would like to give a talk in this stream, please submit a title and abstract of no more than 300 words via
http://www.theorsociety.com/Pages/Conferences/OR61/OR61Abstract.aspx
by selecting 'Advances in Combinatorial and Global Optimisation' as the stream.
(For those who are not familiar with the OR conferences, the usual procedure is to submit a title and an abstract, and then if accepted, to give a talk of 20-25 minutes. A full paper or extended abstract is not required.)
If you have any questions, please do not hesitate to contact us.
Best wishes,
Stream Organisers
Adam Letchford [a.n.letchford@lancaster.ac.uk]
Ender Ozcan and Andrew Parkes [{Ender.Ozcan, Andrew.Parkes}@nottingham.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/
*
**********************************************************
Posts
