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