ENOG

Download

enog@mail.euro-online.org

September 2016

2 participants
2 discussions

PostDoc position in Node Routing Models - University of Lisbon
by Luis Eduardo Neves Gouveia 27 Jan '17

27 Jan '17

PostDoc position in Node Routing Models Closing date: June 15, 2016 Place: University of Lisbon, Department of Statistics and Operations Research, CMAFCIO Salary: EUR 1450 per month (as a reference, minimum wage in the country is EUR 530 per month) Position from September 15th with the duration of 12 months. Topic of research is: Study and development of ILP models for node routing problems, such as the traveling salesman problem, variants with additional constraints (capacity, time windows, maximum distance), several vehicles. several depots. Also, areas involving routing with electric vehicles or in fishery research are topical as well. Candidates must have a CV showing capability to study some of the topics mentioned before, including a reasonable knowledge of ILP solution methods (PhD topic and/or relevant scientific publications). An interview may be requested. Candidates must be fluent in English both in speaking and writing. Applications in electronic form with the usual documents (certificates, CV, publication list, etc.) are to be submitted at http://www.eracareers.pt/opportunities/index.aspx?task=global&jobId=75478 Informal enquiries regarding these vacancies may be addressed to: Professor Luis Gouveia, Head of the Department of Statistics and Operations Research, Faculty of Sciences, University of Lisbon, Portugal. E-mail: legouveia(a)fc.ul.pt ?

1 9

Special Issue of Annals of Operations Research on Decomposition Methods
by Ivana LJUBIC 08 Sep '16

08 Sep '16

*********************************************************** Call for Papers - Annals of Operations Research Special Issue Recent Advances in Decomposition Methods for Hard Optimization Problems *********************************************************** Motivation Divide and conquer, from Latin divide et impera, is one of the key techniques for tackling combinatorial optimization problems. It relies on the idea of decomposing complex problems into a sequence of subproblems that are then easier to handle. Decomposition techniques (such as Dantzig-Wolfe, Lagrangian, or Benders decomposition) are extremely effective in a wide range of applications, including cutting & packing, production & scheduling, routing & logistics, telecommunications, transportation and many others. Moreover, decomposition techniques are playing an important role in many different fields of mixed-integer linear and non-linear optimization, multi objective optimization, optimization under uncertainty, bilevel optimization, etc. Despite the tremendous amount of research on these topics, the mathematical optimization community is constantly faced with new challenges coming from theoretical aspects and real world applications that require the development of new advanced tools. This special issue will be a point of reference for researchers and practitioners that want to learn more about the recent advances in decomposition techniques for hard combinatorial optimization problems. We solicit original and high-quality papers presenting the latest improvements in the field. Topics The purpose of this issue is to provide a view on state of the art decomposition methods in the field of mathematical optimization. We will consider high-quality manuscripts addressing the development of new theoretical insights, algorithmic approaches and computational studies in the context of exact and heuristic methods based on decomposition techniques. Topics of interest include (but are not limited to): - Dantzig-Wolfe decomposition - Stabilization techniques - Row and column generation - Column generation - Branch-and-price - Branch-and-cut-and-price - Branch-and-cut - Benders decomposition - L-shaped method - Generalized Benders decomposition - Lagrangian decomposition - Cross decomposition - Decomposition for non-linear programming - Decomposition for robust and stochastic combinatorial optimization - Heuristic methods derived from exact methods based on decomposition - Applications to challenging real world problems involving some of the above techniques We strongly encourage participants of the EURO 2016 conference to submit full versions of their presented papers to this special issue. This Call for Papers is also open to the entire community of academics and practitioners working in the field of mathematical optimization. Submission Prospective authors are asked to follow the Annals of Operations Research guide for authors (see http://www.springer.com/business+%26+management/operations+research/journal…) Authors should submit a cover letter and a manuscript by January 31, 2017, via the Journal’s online submission site. Manuscripts submitted after the deadline may not be considered for the special volume and may be transferred to a regular volume. Please select "SI Decomposition Methods" as the article type during the submission process. Submitted papers will undergo a regular review process according to the high standard of Annals of Operations Research. Important Dates Paper Submission Open: July 2016 Paper Submission Due: January 31, 2017 Notification of Review Results: July 2017 Revised Manuscript Due: December 2017 Final Decision: no later than October 2018 Guest Editors Fabio Furini, Université Paris-Dauphine, France Ivana Ljubic, ESSEC Business School, France Emiliano Traversi, Paris 13, France ******************************************************** -- Ivana Ljubic Professor of Operations Research ESSEC Business School of Paris 3 Av. Bernard Hirsch B.P. 50105, 95021 Cergy Pontoise Cedex, France Phone: +33 1 34 43 97 26 http://www.essec.edu/faculty/ivana-ljubic

1 0