Programme

Wednesday

17:00-20:00	*registration*
17:00-20:00	*Armeria hall*
20:00 – 21:00	*welcome reception*
20:00 – 21:00	*Armeria hall*

Thursday

09:00 – 09:30	*Tramontana*
09:00 – 09:30	*official opening and opening remarks*
09:30 – 10:30	*Tramontana*
09:30 – 10:30	Gerhard J. Woeginger (EURO Plenary, RWTH Aachen): Lower bound techniques for algorithmic problems
10:30 – 11:00	coffee break
10:30 – 11:00	Armeria hall
11:00 – 13:00	VP	*MP – 1*	*MP – 2*
11:00 – 13:00	*Scheduling-I*	*Metaheuristics-I*	*Combinatorial Optimization*
13:00 – 14:30	lunch break
14:30 – 16:30	VP	*MP – 1*	*MP – 2*
14:30 – 16:30	*Scheduling-II*	*Graph Theory-I*	*Approximation Algorithms*
16:30 – 16:50	coffee break
16:50 – 18:50	VP	*MP – 1*	*MP – 2*
16:50 – 18:50	*Scheduling-III*	*Graph Theory-II*	*Bioinformatics*

Friday

09:00 – 10:00	*Tramontana*
09:00 – 10:00	Robert Bixby (Gurobi Optimization, Inc.): Progress in Linear and Mixed-Integer Programming
10:00 – 10:30	coffee break
10:00 – 10:30	Armeria hall
10:30 – 12:30	VP	*MP – 1*	*MP – 2*
10:30 – 12:30	*Games, Scheduling and Routing*	*Packing Algorithms and SDP*	*Optimization with Applications*
12:50 – 14:30	lunch
14:30 – 15:30	*Tramontana*
14:30 – 15:30	Xiaotie Deng (Shanghai Jiaotong University): Constructive Output of Existentially Proved Structure in Combinatorics
16:10 – 22:00	*excursion and conference dinner*

Saturday

09:00 – 10:00	*Tramontana*
09:00 – 10:00	Bernard Ries (University of Fribourg): On some graph modification problems
10:00 – 10:30	coffee break
10:00 – 10:30	Armeria hall
10:30 – 12:50	VP	*MP – 1*	*MP – 2*
10:30 – 12:50	*Scheduling-IV*	*Metaheuristics-II, Coloring*	*TSP and IP*
13:00 – 13:30	*Tramontana*
13:00 – 13:30	*official closing and closing remarks*
	VP - Lecture room "Velika predavalnica"	MP-1 - Lecture room "Mala predavalnica 1"	MP-2 - Lecture room "Mala predavalnica 2"


Deatailed schedule of talks



Thursday

09:30 – 10:30	*Tramontana*
	Chair: Silvano Martello
	Gerhard J. Woeginger (EURO Plenary, RWTH Aachen): Lower bound techniques for algorithmic problems
			(Top)
	VP	*MP – 1*	*MP – 2*
	Chair: Zhao Zhang	Chair: Celso Ribeiro	Chair: Wieslaw Kubiak
	*Scheduling-I*	*Metaheuristics-I*	*Combinatorial Optimization*
11:00 – 11:20	Raphaël Bleuse, Giorgio Lucarelli, Gregory Mounie, Denis Trystram: Interference-Aware Scheduling with 2D-Torus as a Case Study	Ozgur Ozpeynirci, Onur Can Yılmaz, Seda Lafcı: Ranking Alternatives Using DEA: A Dual Approach	Xudong Hu: On Combinatorial Optimization Problems with Interval Data
11:20 – 11:40	Guangting Chen: Approximate the scheduling of quay cranes with non-crossing constraints	Gorka Kobeaga, María Merino, Jose A. Lozano: Solving large-sized orienteering problem instances using an evolutionary algorithm	Evgeny Gurevsky, Sergey Kovalev, Mikhail Y. Kovalyov: A min-max risk version of some combinatorial optimization problems with controllable data
11:40 – 12:00	Maciej Drozdowski, Natalia Shakhlevich: Scheduling Divisible Loads with Time and Cost Constraints	Kerstin Maier, Philipp Hungerländer: Exact and Heuristic Approaches for the Checkpoint Ordering Problem	Wieslaw Kubiak, Dariusz Dereniowski, Yori Zwols: The complexity of minimum-length path decompositions
12:00 – 12:20	Marek Mika: Energy aware scheduling of data transmission tasks	Sel Ozcan, Deniz Türsel Eliiyi, Uğur Eliiyi: Adaptive Large Neighborhood and Variable Neighborhood Search for Parallel Machine Capacitated Lot Sizing and Scheduling	Stefan Lendl, Ante Custic, Abraham Punnen: Combinatorial Optimization Problems with Interaction Costs
12:20 – 12:40	Rafal Rozycki: Minimum energy allocation of power to jobs performed on a single machine	Selin Özpeynirci, Burcu Özmen, Ozgur Ozpeynirci: An Interactive Method for Inverse Multiple Criteria Sorting Problem	Janez Povh: From PositivestellenSatz to relaxations of combinatorial optimization problems
12:40 – 13:00	Chris Potts: Baggage Reclaim Assignment and Scheduling Problem	Damla Kizilay, Deniz Türsel Eliiyi: A Constraint Programming Model for an Integrated Assignment and Routing Problem	Boting Yang: A New Lower Bound for the Positive Semidefinite Zero Forcing
			(Top)
	VP	*MP – 1*	*MP – 2*
	Chair: Ulrich Pferschy	Chair: Giuseppe Lancia	Chair: Minming Li
	*Scheduling-II*	*Graph Theory-I*	*Approximation Algorithms*
14:30 – 14:50	Yakov Shafransky, Erwin Pesch, Ilia Fridman: Single machine scheduling to minimize the maximum cost under the interval uncertainty of processing times and additional parameters of jobs	Miklos Kresz: The inverse matching problem for vertex weights	Aleksey Glebov: A 5/6-approximation algorithm for the TSP-max in an incomplete graph with triangle inequality
14:50 – 15:10	Alan Soper, Vitaly Strusevich: Power of Splitting on Parallel Machines	Christophe Picouleau, Dominique de Werra, Marie-Christine Costa: Minimal graphs for 2-factor extension	Zhao Zhang: Approximation Algorithm for Minimum Partial Set Multi-Cover Problem
15:10 – 15:30	Malgorzata Sterna, Xin Chen, Kateryna Czerniachowska, Xin Han, Jacek Blazewicz: Late Work Scheduling Problem on Two Parallel Machines	Eleonora Pippia, Giuseppe Lancia, Franca Rinaldi: An ILP-based proof that 1-tough 4-regular graphs of at most 17 nodes are Hamiltonian	Peng Zhang, Dachuan Xu: Approximation and Hardness Results for the Max k-Uncut Problem
15:30 – 15:50	İstenç Tarhan, Ceyda Oguz: Order Acceptance and Scheduling Problem to Maximize Revenue	Xiao-Dong Zhang: The Turan Numbers for Linear Forests	Jianhua Tu: Approximation algorithms and Parameterized algotihms of the vertex cover Pt problem
15:50 – 16:10	Guochuan Zhang: Scheduling with lower rank processing times	Guiying Yan: An Approximate Ore-type Result for Tight Hamilton Cycles in Uniform Hypergraphs	Surena Toktokhoeva: A polynomial 3/5-approximation algorithm for the asymmetric maximization version of 3-PSP
16:10 – 16:30	József Békési, Gábor Galambos: Analysis of a First Fit Decreasing Based Algorithm for the Coupled Task Problem with UET Jobs	Liying Kang, Erfang Shan: w-Centroids and Least (w,l)-Central Subtrees in Weighted Trees	Dachuan Xu: A Local Search Approximation Algorithm for a Sum of Squares k-Facility Location Problem
			(Top)
	VP	*MP – 1*	*MP – 2*
	Chair: Yingdong Shen	Chair: Liying Kang	Chair: Jacek Blazevicz
	*Scheduling-III*	*Graph Theory-II*	*Bioinformatics*
16:50 – 17:10	Grzegorz Pawlak, Gaurav Singh, Jacek Blazewicz: Single railway scheduling problem	Rahimeh Neamatian Monemi, Shahin Gelareh: The Ring Spur Assignment Problem: New formulation, valid inequalities and a branch-and-cut approach	Marta Szachniuk, Tomasz Żok, Mariusz Popenda: Pseudoknot order determination as graph coloring problem
17:10 – 17:30	Karin Bogner, Ulrich Pferschy, Roland Unterberger, Herwig Zeiner: Optimized Scheduling in Human-Robot Collaboration – A Use Case in the Production of Printed Circuit Boards	Xianyue Li: Partial Inverse Maximum Spanning Tree Problem	Maciej Antczak, Mariusz Popenda, Tomasz Żok, Marta Szachniuk: New algorithms to encode complex pseudoknotted RNA structures in extended dot-bracket notation
17:30 – 17:50	Aykan Akincilar, Ertan Güner: A robust planning for shuttle scheduling in the airport	Yongtang Shi, Shasha Li, Yan Zhao: On the complexity of k-rainbow cycle colouring problems	Maciej Miłostan: Mining of Biological Data
17:50 – 18:10	Mate Hegyhati: Timed Automata based scheduling of automated wet-etch stations	András London: Community detection in bipartite networks using statistically validated projections	Jakub Wiedemann, Tomasz Żok, Maciej Miłostan, Marta Szachniuk: LCS-TA to identify similarity in molecular structures
18:10 – 18:30	Sebastian Meiswinkel, Dominik Kress, Erwin Pesch: Incentive Compatible Mechanisms for Scheduling Two-Parameter Job Agents on Parallel Identical Machines to Minimize the Weighted Number of Late Jobs	Yong Zhang: Uniform Information Exchange in Multi-channel Wireless Ad Hoc Networks	Piotr Lukasiak, Tomasz Ratajczak, Maciej Antczak: Novel methods for atoms alignment score in 3D space
18:30 – 18:50	Alkin Yurtkuran: Discrete electromagnetism-like algorithm for flexible job shop scheduling	Mohammadreza Galavii: The obnoxious p-median problem in general networks
			(Top)

Friday

09:00 – 10:00	*Tramontana*
	Chair: Xiaodong Hu
	Robert Bixby (Gurobi Optimization, Inc.): Progress in Linear and Mixed-Integer Programming
			(Top)
	VP	*MP – 1*	*MP – 2*
	Chair: Xujin Chen	Chair: Michele Monaci	Chair: Boting Yang
	*Games, Scheduling and Routing*	*Packing Algorithms and SDP*	*Optimization with Applications*
10:30 – 10:50	Yukun Cheng: Truthfulness of a Proportional Sharing Mechanism in Resource Exchange	Lujie Chen: Optimization methods for LEGO structure transformation	Ibrahim Muter, Ethem Canakoglu: Multi-Objective Optimization Approaches for Recommender Systems
10:50 – 11:10	Minming Li: Facility Location Games: From Origin to Recent Development	Maxence Delorme, Gianluca Costa, Manuel Iori, Enrico Malaguti, Silvano Martello: Measuring human performances on two-dimensional packing problems	Marcin Borowski, Karolina Baumgart, Piotr Formanowicz: Algorithms for the identification of the components of the secondary metabolites
11:10 – 11:30	Changjun Wang: Balancing Efficiency and Equality in Vehicle Licenses Allocation	Michele Monaci, Silvano Martello: Heuristic algorithms for the multiple knapsack assignment problem	Sinem Tokcaer, Ozgur Ozpeynirci: A Branch and Price Algorithm for Shipment Consolidation and Dispatching Problem with Cross-Docks
11:30 – 11:50	Balazs David, Miklos Kresz: Vehicle assignment with maintenance constraints	Xavier Schepler, André Rossi, Evgeny Gurevsky, Alexandre Dolgui: A branch-and-price algorithm for robust bin packing with variable size items	Congying Han, Mingqiang Li, Tiande Guo: Shrinking Gradient Descent Algorithms For Total Variation Regularized Image Denoising
11:50 – 12:10	Philipp Hungerländer, Andrea Rendl, Christian Truden: On the Slot Optimization Problem in On-Line Vehicle Routing	Elisabeth Gaar, Malwina Duda, Franz Rendl: Improving an Upper Bound on the Stability Number with the Bundle Method for SDP	Annelies Lejon, Greet Vanden Berghe: Optimal shift design for irregular demand
12:10 – 12:30	Yindong Shen: Vehicle scheduling based on stochastic trip times	Angelika Wiegele, Marianna De Santis, Franz Rendl: Augmented Lagrangian Approaches for Semidefinite Programming via Dual Factorization	Esther Mohr, Markus Döhring: Which product to sell in addition? A machine learning approach to extract and exploit customer buying patterns
			(Top)
14:30 – 15:30	*Tramontana*
	Chair: Guochuan Zhang
	Xiaotie Deng (Shanghai Jiaotong University): Constructive Output of Existentially Proved Structure in Combinatorics
			(Top)

Saturday

09:00 – 10:00	*Tramontana*
	Chair: Andrej Brodnik
	Bernard Ries (University of Fribourg): On some graph modification problems
			(Top)
	VP	*MP – 1*	*MP – 2*
	Chair: Gerhard Wäscher	Chair: Chris Potts	Chair: Yong Zhang
	*Scheduling-IV*	*Metaheuristics-II, Coloring*	*TSP and IP*
10:30 – 10:50	Olivér Ősz, Mate Hegyhati: Combinatorial approach for the multi-mode resource-constrained project scheduling problem	Grzegorz Waligora: Solving some discrete-continuous project scheduling problems by metaheuristic approaches	Anna Jellen, Philipp Hungerländer, Anja Fischer: Optimal Construction Schemes for the Traveling Salesperson Problem with Forbidden Neighborhoods on Regular 3D Grids
10:50 – 11:10	Dominik Kress, Nils Boysen, Erwin Pesch: Models and algorithms for a partition problem arising in warehousing	Tibor Dulai, Peter Auer, Gyorgy Dosa, Armin Fügenschuh, Ronald Ortner, Ágnes Stark-Werner: Production planning: easy or hard? Solving a complex scheduling model by a MILP solver, an efficient heuristic method, and their combination	Celso Ribeiro, Ruben Interian: A GRASP with restarts heuristic for the Steiner traveling salesman problem
11:10 – 11:30	Ulrich Pferschy, Joachim Schauer: Order batching and routing in a warehouse logistics system	Roberto Aringhieri, Andrea Grosso, Pierre Hosteins, Rosario Scatamacchia: A performance comparison of heuristic and metaheuristic algorithms for the Critical Node Problem	Szymon Wasik, Maciej Antczak, Jan Badura, Artur Laskowski, Maciej Olszowy, Tomasz Sternal, Krzysztof Wedrowicz: Solving Selective TSP Problem Using Crowdsourced Programming Challenge
11:30 – 11:50	Karim Tamssaouet, Stéphane Dauzere-Peres, Claude Yugma, Jacques Pinaton: A Tabu Search Approach for The Job-Shop Scheduling with Availability Constraints	Sandor Szabo, Bogdan Zavalnij: Coloring Using Hypergraph Reformulation	Rostislav Staněk, Klaus Ladner, Peter Greistorfer, Ulrich Pferschy: Geometric and ILP-based heuristics for the quadratic travelling salesman problem
11:50 – 12:10	Ilya Chernykh, Ekaterina Lgotina: Sufficient conditions of efficient solvability for routing open shops on a tree	Bogdan Zavalnij, Sandor Szabo: Graph Coloring via Clique Search with Symmetry Breaking	Kolos Ágoston, Peter Biro: Integer programming methods for special college
12:10 – 12:30		Junlei Zhu, Yuehua Bu: 2-Distance Coloring of Graphs	Xujin Chen, Qin Chen, Wenan Zang: The Minimum-Weight Kernel Problem and Polyhedral Approaches
			(Top)