Accepted papers

Kolos Ágoston, Peter Biro: Integer programming methods for special college
Aykan Akincilar, Ertan Güner: A robust planning for shuttle scheduling in the airport
Emine Akyol, Tugba Saraç, Josef Bulicek: Platform Allocation to Trains for Prague Main Station
Maciej Antczak, Mariusz Popenda, Tomasz Żok, Marta Szachniuk: New algorithms to encode complex pseudoknotted RNA structures in extended dot-bracket notation
Roberto Aringhieri, Andrea Grosso, Pierre Hosteins, Rosario Scatamacchia: A performance comparison of heuristic and metaheuristic algorithms for the Critical Node Problem
József Békési, Gábor Galambos: Analysis of a First Fit Decreasing Based Algorithm for the Coupled Task Problem with UET Jobs
Raphaël Bleuse, Giorgio Lucarelli, Gregory Mounie, Denis, Trystram: Interference-Aware Scheduling with 2D-Torus as a Case Study
Karin Bogner, Ulrich Pferschy, Roland Unterberger, Herwig Zeiner: Optimized Scheduling in Human-Robot Collaboration – A Use Case in the Production of Printed Circuit Boards
Marcin Borowski, Karolina Baumgart, Piotr Formanowicz: Algorithms for the identification of the components of the secondary metabolites
Jose Brandao: Metaheuristics for the vehicle routing problem with backhauls and soft time windows
Ahmet Camcı, Sinem Tokcaer: Integrated Shipment Consolidation and Dispatching and Container Loading Problems
Guangting Chen: Approximate the scheduling of quay cranes with non-crossing constraints
Lujie Chen: Optimization methods for LEGO structure transformation
Xujin Chen, Qin Chen, Wenan Zang: The Minimum-Weight Kernel Problem and Polyhedral Approaches
Yukun Cheng: Truthfulness of a Proportional Sharing Mechanism in Resource Exchange
Ilya Chernykh, Ekaterina Lgotina: Sufficient conditions of efficient solvability for routing open shops on a tree
Balazs David, Miklos Kresz: Vehicle assignment with maintenance constraints
Maxence Delorme, Gianluca Costa, Manuel Iori, Enrico Malaguti, Silvano Martello: Measuring human performances on two-dimensional packing problems
Maciej Drozdowski, Natalia Shakhlevich: Scheduling Divisible Loads with Time and Cost Constraints
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
Elisabeth Gaar, Malwina Duda, Franz Rendl: Improving an Upper Bound on the Stability Number with the Bundle Method for SDP
Mohammadreza Galavii: The obnoxious p-median problem in general networks
Aleksey Glebov: A 5/6-approximation algorithm for the TSP-max in an incomplete graph with triangle inequality
Evgeny Gurevsky, Sergey Kovalev, Mikhail Y. Kovalyov: A min-max risk version of some combinatorial optimization problems with controllable data
Congying Han, Mingqiang Li, Tiande Guo: Shrinking Gradient Descent Algorithms For Total Variation Regularized Image Denoising
Mate Hegyhati: Timed Automata based scheduling of automated wet-etch stations
Alain Hertz, Pierre Hansen, Cherif Sellal, Damir Vukicevic, Mustapha Aouchiche, Gilles Caporossi: Edge Realizability of Connected Simple Graphs
Xia Hong: Two Generalizations for Completely Independent Spanning Trees
Markó Horváth, Tamas Kis: Polyhedral results for project scheduling problems
Xudong Hu: On Combinatorial Optimization Problems with Interval Data
Yun Jiao Hu: Portfolio Selection Under Revised CVaR Model
Olivier Hudry: Routing and wavelength assignment (RWA) in optical networks by independent sets in conflict graphs
Philipp Hungerländer, Andrea Rendl, Christian Truden: On the Slot Optimization Problem in On-Line Vehicle Routing
Anna Jellen, Philipp Hungerländer, Anja Fischer: Optimal Construction Schemes for the Traveling Salesperson Problem with Forbidden Neighborhoods on Regular 3D Grids
Liying Kang, Erfang Shan: w-Centroids and Least (w,l)-Central Subtrees in Weighted Trees
Damla Kizilay, Deniz Türsel Eliiyi: A Constraint Programming Model for an Integrated Assignment and Routing Problem
Gorka Kobeaga, María Merino, Jose A. Lozano: Solving large-sized orienteering problem instances using an evolutionary algorithm
Dominik Kress, Nils Boysen, Erwin Pesch: Models and algorithms for a partition problem arising in warehousing
Miklos Kresz: The inverse matching problem for vertex weights
Wieslaw Kubiak, Dariusz Dereniowski, Yori Zwols: The complexity of minimum-length path decompositions
Annelies Lejon, Greet Vanden Berghe: Optimal shift design for irregular demand
Stefan Lendl, Ante Custic, Abraham Punnen: Combinatorial Optimization Problems with Interaction Costs
Minming Li: Facility Location Games: From Origin to Recent Development
Xianyue Li: Partial Inverse Maximum Spanning Tree Problem
András London: Community detection in bipartite networks using statistically validated projections
Piotr Lukasiak, Tomasz Ratajczak, Maciej Antczak: Novel methods for atoms alignment score in 3D space
Kerstin Maier, Philipp Hungerländer: Exact and Heuristic Approaches for the Checkpoint Ordering Problem
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
Marek Mika: Energy aware scheduling of data transmission tasks
Maciej Miłostan: Mining of Biological Data
Michele Monaci, Silvano Martello: Heuristic algorithms for the multiple knapsack assignment problem
Gur Mosheiov: Batch scheduling on a flow-shop with unit time jobs and machine-dependent setup times
Ibrahim Muter, Ethem Canakoglu: Multi-Objective Optimization Approaches for Recommender Systems
Gábor Nagy, Trung Hieu Tran, Thuba Nguyen, Niaz Wassan: An Efficient Heuristic Algorithm for the Alternative-Fuel Station Location Problem
Rahimeh Neamatian Monemi, Shahin Gelareh: The Ring Spur Assignment Problem: New formulation, valid inequalities and a branch-and-cut approach
Olivér Ősz, Mate Hegyhati: Combinatorial approach for the multi-mode resource-constrained project scheduling problem
Ozgur Ozpeynirci, Onur Can Yılmaz, Seda Lafcı: Ranking Alternatives Using DEA: A Dual Approach
Selin Özpeynirci, Burcu Özmen, Ozgur Ozpeynirci: An Interactive Method for Inverse Multiple Criteria Sorting Problem
Reyhan Pinar Parkan, Vildan Ozkir: Terminal Simulation Model of a Hub Airport
Grzegorz Pawlak, Gaurav Singh, Jacek Blazewicz: Single railway scheduling problem
Ulrich Pferschy, Joachim Schauer: Order batching and routing in a warehouse logistics system
Christophe Picouleau, Dominique de Werra, Marie-Christine Costa: Minimal graphs for 2-factor extension
Eleonora Pippia, Giuseppe Lancia, Franca Rinaldi: An ILP-based proof that 1-tough 4-regular graphs of at most 17 nodes are Hamiltonian
Chris Potts: Baggage Reclaim Assignment and Scheduling Problem
Janez Povh: From PositivestellenSatz to relaxations of combinatorial optimization problems
Celso Ribeiro, Ruben Interian: A GRASP with restarts heuristic for the Steiner traveling salesman problem
Rafal Rozycki: Minimum energy allocation of power to jobs performed on a single machine
Xavier Schepler, André Rossi, Evgeny Gurevsky, Alexandre Dolgui: A branch-and-price algorithm for robust bin packing with variable size items
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
Yindong Shen: Vehicle scheduling based on stochastic trip times
Yongtang Shi, Shasha Li, Yan Zhao: On the complexity of k-rainbow cycle colouring problems
Alan Soper, Vitaly Strusevich: Power of Splitting on Parallel Machines
Rostislav Staněk, Klaus Ladner, Peter Greistorfer, Ulrich Pferschy: Geometric and ILP-based heuristics for the quadratic travelling salesman problem
Malgorzata Sterna, Xin Chen, Kateryna Czerniachowska, Xin Han, Jacek Blazewicz: Late Work Scheduling Problem on Two Parallel Machines
Sandor Szabo, Bogdan Zavalnij: Coloring Using Hypergraph Reformulation
Marta Szachniuk, Tomasz Żok, Mariusz Popenda: Pseudoknot order determination as graph coloring problem
Karim Tamssaouet, Stéphane Dauzere-Peres, Claude Yugma, Jacques Pinaton: A Tabu Search Approach for The Job-Shop Scheduling with Availability Constraints
İstenç Tarhan, Ceyda Oguz: Order Acceptance and Scheduling Problem to Maximize Revenue
Sinem Tokcaer, Ozgur Ozpeynirci: A Branch and Price Algorithm for Shipment Consolidation and Dispatching Problem with Cross-Docks
Surena Toktokhoeva: A polynomial 3/5-approximation algorithm for the asymmetric maximization version of 3-PSP
Oxana Tsidulko, Edward Gimadi, Ivan Rykov: An Approximation Algorithm for the Euclidean Maximum Connected k-Factor
Jianhua Tu: Approximation algorithms and Parameterized algotihms of the vertex cover Pt problem
Deniz Türsel Eliiyi, Sel Ozcan, Uğur Eliiyi: Adaptive Large Neighborhood and Variable Neighborhood Search for Parallel Machine Capacitated Lot Sizing and Scheduling
Grzegorz Waligora: Solving some discrete-continuous project scheduling problems by metaheuristic approaches
Changjun Wang: Balancing Efficiency and Equality in Vehicle Licenses Allocation
Szymon Wasik, Maciej Antczak, Jan Badura, Artur Laskowski, Maciej Olszowy, Tomasz Sternal, Krzysztof Wedrowicz: Solving Selective TSP Problem Using Crowdsourced Programming Challenge
Jakub Wiedemann, Tomasz Żok, Maciej Miłostan, Marta Szachniuk: LCS-TA to identify similarity in molecular structures
Angelika Wiegele, Marianna De Santis, Franz Rendl: Augmented Lagrangian Approaches for Semidefinite Programming via Dual Factorization
Dachuan Xu: A Local Search Approximation Algorithm for a Sum of Squares k-Facility Location Problem
Guiying Yan: An Approximate Ore-type Result for Tight Hamilton Cycles in Uniform Hypergraphs
Boting Yang: A New Lower Bound for the Positive Semidefinite Zero Forcing
Fengmei Yang: Designing credit supervision mechanism in C2B2C e-commerce
Alkin Yurtkuran: Discrete electromagnetism-like algorithm for flexible job shop scheduling
Bogdan Zavalnij, Sandor Szabo: Graph Coloring via Clique Search with Symmetry Breaking
Xiao-Dong Zhang: The Turan Numbers for Linear Forests
Zhao Zhang: Approximation Algorithm for Minimum Partial Set Multi-Cover Problem
Peng Zhang, Dachuan Xu: Approximation and Hardness Results for the Max k-Uncut Problem
Guochuan Zhang: Scheduling with lower rank processing times
Yong Zhang: Uniform Information Exchange in Multi-channel Wireless Ad Hoc Networks
Jun Zhou, Sonia Cafieri, Daniel Delahaye, Mohammed Sbihi: Optimal Routes Design in Terminal Maneuvering Area Using Simulated Annealing
Junlei Zhu, Yuehua Bu: 2-Distance Coloring of Graphs