Chair:
Prof. Imed Kacem, LCOMS Lab, University of Lorraine, France

CFP: http://codit2017.com/Special%20Sessions/Special-Session-CoDIT2017-HAACP.pdf

Session description For several decades, the combinatorial problems have constituted a privileged topic. Motivated by their industrial applications, several research teams studied these problems and proposed various models and resolution approaches. The aim of this special session is to present the recent heuristics and approximation algorithms in this field. Theoretical and practical works can both be submitted. Both works with applicative or theoretical aspects are encouraged.    
Topics of interest include, but are not limited to, the following topics:  
 Combinatorial Optimization theory   
 Approximation algorithms and schemes applied to solve combinatorial problems  
 Differential approximation approaches   
 Polynomial approximation   
 Worst‐case analysis of heuristics
SUBMISSION
Please submit your full paper choosing the right Special Session (15‐Special Session: Heuristics and Approximation Algorithms for Combinatorial Problems) on the EasyChair for CoDIT'17 website: https://easychair.org/conferences/?conf=codit17  
All papers must be written in English and should describe original work. The length of the paper is limited to a maximum of 6 pages (in the standard IEEE conference double column format).