Special Issues

 

Special Issues of Networks and of Journal of Combinatorial Optimization are associated with ISCO 2016.

The calls for papers are reported below.


 

Networks

We invite submissions of novel research articles for a forthcoming issue of Networks. The special issue is also open to papers which have not been presented at ISCO 2016. 

High quality research papers are solicited to address theoretical as well as practical issues of Combinatorial Optimization of a theoretical or practical nature involving graphs.

Topics of interest include, but are not limited to:

- Approximation algorithms
- Graph coloring
- Exact algorithms
- Graph and network algorithms
- Computational complexity
- Network flow theory
- Location theory
- Vehicle routing
- Fast algorithms for special graph classes
- Scheduling algorithms

The deadline for submission of full papers is October 1, 2016.
We aim at completing a first review of all papers by January 31, 2017.

Submission Manuscripts should be submitted electronically to the following address:
This email address is being protected from spambots. You need JavaScript enabled to view it.

Research articles, review articles as well as communications are invited.
Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers).
All manuscripts are refereed through a peer-review process.

Additional information about the special issue can be obtained from the Guest Editors.

Guest Editors

Francesco Carrabs
Dep. of Mathematics, University of Salerno, Italy
This email address is being protected from spambots. You need JavaScript enabled to view it.

Raffaele Cerulli
Dep. of Mathematics, University of Salerno, Italy
This email address is being protected from spambots. You need JavaScript enabled to view it.

Monica Gentili
Dep. of Mathematics, University of Salerno, Italy
Industrial Engineering Dep., University of Louisville, KY, USA
This email address is being protected from spambots. You need JavaScript enabled to view it.
This email address is being protected from spambots. You need JavaScript enabled to view it.


 

Journal of Combinatorial Optimization

We invite submissions of novel research articles for a forthcoming issue of Journal of Combinatorial Optimization on Combinatorial Optimization. The special issue is also open to papers which have not been presented at ISCO 2016.

High quality research papers are solicited to address theoretical as well as practical issues of Combinatorial Optimization.

Topics of interest include, but are not limited to:

- Approximation algorithms
- Cutting-plane algorithms
- Polyhedral combinatorics
- Branch-and-cut-and-price algorithms
- Graph and network algorithms
- Linear and nonlinear (mixed-)integer programming
- Computational complexity
- Randomized algorithms
- Scheduling algorithms
- Interior point methods

The deadline for submission of full papers is October 1, 2016.
We aim at completing a first review of all papers by January 31, 2017.

For their submissions, the authors should follow the “Instructions for Authors” of the journal website https://www.editorialmanager.com/joco/default.aspx. The article type for this issue is “S.I. : ISCO2016” and selecting this article type will ensure that the submission is sent to the editors of the special issue.

Information about Journal of Combinatorial Optimization is available at

http://link.springer.com/journal/10878

Additional information about the special issue can be obtained from the Guest Editors.

Guest Editors

Satoru Fujishige
RIMS, Kyoto University, Japan
This email address is being protected from spambots. You need JavaScript enabled to view it.

A. Ridha Mahjoub
LAMSADE, Université-Paris Dauphine, Paris, France
This email address is being protected from spambots. You need JavaScript enabled to view it.

Franz Rendl
Alpen-Adria University Klagenfurt, Institut für Mathematik, Klagenfurt, Austria
This email address is being protected from spambots. You need JavaScript enabled to view it.