Preface ISCO 2018

The proceedings contain 35 papers. The special focus in this conference is on Combinatorial Optimization. The topics include: Online firefighting on trees; a multigraph formulation for the generalized minimum spanning tree problem; the distance polytope for the vertex coloring problem; A PTAS for the time-invariant incremental knapsack problem; on bounded pitch inequalities for the min-knapsack polytope; Efficient algorithms for measuring the funnel-likeness of DAGs; jointly optimizing replica placement, requests distribution and server storage capacity on content distribution networks; an exact column generation-based algorithm for bi-objective vehicle routing problems; multi-start local search procedure for the maximum fire risk insured capital problem; Compact MILP formulations for the p-center problem; a branch-and-bound procedure for the robust cyclic job shop problem; an exact algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem; descent with mutations applied to the linear ordering problem; characterization and approximation of strong general dual feasible functions; preemptively guessing the center; improved algorithms for k-domination and total k-domination in proper interval graphs; A heuristic for maximising energy efficiency in an OFDMA system subject to QoS constraints; an integer programming approach to the student-project allocation problem with preferences over projects; even flying cops should think ahead; a generalization of the minimum branch vertices spanning tree problem; the next release problem: Complexity, exact algorithms and computations; a polyhedral view to generalized multiple domination and limited packing; alternating current optimal power flow with generator selection; parameterized algorithms for module map problems; 2 CSPs all are approximable within a constant differential factor.