[Opt-Net] CfP: EJOR Featured Cluster: Recent Advances in Exact Methods for Multi-Objective Optimisation

Matthias Ehrgott m.ehrgott at lancaster.ac.uk
Mon Jan 26 13:29:03 CET 2015


********************************************************
            Call For Papers - EJOR Featured Cluster

               Recent Advances in Exact Methods
               for Multi-Objective Optimisation
********************************************************

*Motivation*

The development of exact methods for multi-objective optimisation (MOO)
is experiencing renewed interest in the OR community as witnessed by the
growing body of research emerging in that domain. Recent advances in the
development of nonlinear, linear and mixed-integer programming solvers
push the boundaries towards more challenging areas (including, e.g.
global, bi-level and uncertain optimisation problems). Hence solving to
optimality larger, more difficult real-world problems involving several
conflicting objectives has been put within reach. Also, researchers
previously working in single-objective optimisation are increasingly
contributing to the fast progress of the development of exact
multi-objective optimisation algorithms. In this featured cluster we
solicit original and high-quality papers presenting the latest research
in the field of exact algorithms for multi-objective mixed integer,
linear and non-linear programming, exact methods for MOO under
uncertainty, as well as heuristics derived from exact methods for MOO.

*Contents*

The purpose of this featured cluster is to increase the visibility of
exact methods for MOO and to motivate a broader group of researchers to
contribute to the field. We will consider high-quality manuscripts
addressing the development of new theoretical insights, algorithmic
approaches and computational studies in the context of exact methods for
MOO.

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

- multi-objective branch-and-bound algorithms
- multi-objective branch-and-cut algorithms
- column generation and branch-and-price algorithms for MOO
- mixed-integer (non)-linear MOO
- stochastic MOO
- robust MOO
- continuous non-linear MOO
- objective space algorithms
- heuristic methods derived from exact methods for MOO
- complexity analysis and worst case behaviour of MOO algorithms

Although we strongly encourage the submission of papers presented at the
workshop "Recent Advances in Multi-Objective Optimization"
(moo.univie.ac.at), this Call for Papers is open to the entire community
of academics and practitioners working in the field of multi-objective
optimisation.

*Submission*

Prospective authors are asked to follow the EJOR guide for authors and
submit their papers from April 1, 2015 via the EES
(http://ees.elsevier.com/ejor). Please select "Feat.Cluster Exact MOO"
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 Open: April 1, 2015
Paper Submission Due: July 1, 2015
Notification of Review Results: October 31, 2015
Revised Manuscript Due: January 15, 2016
Final Decision: March 15, 2016

*Guest Editors*

Matthias Ehrgott, Lancaster University, UK
Ivana Ljubic, University of Vienna, Austria
Sophie N. Parragh, University of Vienna, Austria

********************************************************



-------------- next part --------------
_______________________________________________
moo mailing list
moo at lists.univie.ac.at
https://lists.univie.ac.at/mailman/listinfo/moo



More information about the Opt-Net mailing list