PCO 2016 - IEEE Workshop on Parallel Computing and Optimization

The IEEE Workshop on Parallel Computing and Optimization aims at providing a forum for scientific researchers and engineers on recent advances in the field of parallel or distributed computing for difficult combinatorial optimization problems, like 0-1 multidimensional knapsack problems and cutting stock problems, large scale linear programming problems, nonlinear optimization problems and global optimization problems. Emphasis will be placed on new techniques for the solution of these difficult problems like cooperative methods for integer programming problems and polynomial optimization methods. Aspects related to Combinatorial Scientific Computing (CSC) will also be treated. In particular, we solicit submissions of original manuscripts on sparse matrix computations and relatives (including graph algorithms); and related methods and tools for their efficiency on different parallel systems. The use of new approaches in parallel and distributed computing like GPU, MIC, grid computing, peer to peer computing will be considered. Application to cloud computing, planning, logistics, manufacturing, finance, telecommunications and computational biology will be considered.
Topics:
* Integer programming, linear programming, nonlinear programming.
* Global optimization, polynomial optimization.
* Exact methods, heuristics.
* Parallel algorithms for combinatorial optimization.
* Parallel metaheuristics.
* Distributed optimization algorithms.
* Parallel sparse matrix computations, graph algorithms, load balancing.
* Hybrid computing and the solution of optimization problems.
* Peer to peer computing and optimization problems.
* Applications: cloud computing, planning, logistics, manufacturing, finance, telecommunications, computational biology, combinatorial algorithms in high performance computing.