Contributed Talks

Special Issue *** DEADLINE EXTENDED! ***

A special issue of the Journal of Combinatorial Optimization will be dedicated to ECCO 2019. The issue will be based on contributions presented at ECCO XXXII, but the invitation to submit will be extended to all ECCO members. All articles will be thoroughly refereed according to the high standards of such journals. The submission process is now open and the deadline for submissions has been extended to 15 January 2020. Further details can be found here.

 

Contributions

Contributions in any area listed below are welcome. Participants are invited to deliver a 20-minute talk by submitting an abstract of their talk. All abstracts will be refereed and acceptance depends on the reviewers’ feedback. The accepted abstracts will be published in a Conference Booklet of Abstracts.

Abstracts must be prepared using the LaTeX template provided. Both the TEX and the PDF files should be submitted by e-mail on [email protected]. The period for submissions of abstracts is now closed. Acceptance has been communicated to all the authors.

The final list of the titles of the contributed talks can be viewed here.

The Conference Booklet of Abstracts can be found here.

 

Facilities for contributed talks

• The contributed talks will run in three parallel sessions. The duration of each talk is of 20 minutes, including question time.
• Each room will be equipped with a computer connected to a projector and a flipchart. Speakers are asked to bring their presentation (in pdf or ppt format) on a USB drive. Please make sure that you put your presentation on the computer during the break before your session of talks.
• We will also have one overhead projector for acetate sheets and one document reader connected to a projector to share among the four rooms. Speakers wishing to make use of any one of these two devices are asked to inform the Organising Committee in advance.

 

Aims and Objectives

The ECCO annual meetings aim to bring together researchers in the field of Combinatorial Optimization to present their work, share experiences, and discuss recent advances in theory and applications. The primary objectives are:

• exchanging results and experiences in solving real-world combinatorial optimization problems
• reporting on development and implementation of appropriate models and efficient solution methods for combinatorial optimization problems
• establishing networking contacts between individuals and research groups working on related topics
• promoting the work on combinatorial optimization (theory and applications) to the broader scientific community
• identifying challenging research problems for the field, as well as promising research outlets (both in theory and applications)
• promoting interactions with researchers in other related fields

 

Topics of Interest

• theory and applications of combinatorial optimization
• exact solution algorithms, approximation algorithms, heuristics, and meta-heuristics for combinatorial optimization problems
• integer programming, global optimization, stochastic integer programming, multi-objective programming, graph theory and network flows
• application areas include logistics and supply chain optimization, manufacturing, energy production and distribution, land consolidation, telecommunications, bio-informatics, finance, discrete tomography, discrete and hybrid dynamical systems, and other fields

 

Titles of contributed talks

SURNAME	NAME	TITLE OF TALK
Alpers	Andreas	On Tomographic Super-Resolution Imaging
Antczak	Maciej	Polynomial-time algorithms for structural alignment of short- and long-range contact-based 3D substructures
Archetti	Claudia	Kernel Search Heuristic for the Multi-Vehicle Inventory Routing Problem
Arkhipov	Dmitry	Resource capacity and time lag propagation techniques for RCPSP MAX problem
Averbakh	Igor	The Traveling Salesmen Location Problem with Path-Tours
Beasley	John E.	Order allocation, rack allocation and rack sequencing for pickers in a mobile rack environment
Behmaram	Afshin	Some New Results on Dominating Induced Matching
Borg	Peter	Reducing the maximum degree of a graph
Borowski	Marcin	Computing methods for analysis of lipidomics mass spectra
Byrne	Thomas	The One-Round Voronoi Game Played on the Rectilinear Plane
Chen	Bo	A Tractable Network Game of Atomic Dynamic Flows
Dahlbeck	Mirko	A mixed-integer programming model for the T-row Facility Layout Problem
Delorme	Maxence	Mathematical models for the Hospitals / Residents problem with Couples, Ties, and Incomplete lists
Domínguez	Concepción	Formulations for the Capacitated Rank Pricing Problem
Dragoti-Çela	Eranda	Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid
Ekim	Tınaz	The Defensive Domination Problem
Gritzmann	Peter	District Design via Diagrams
Healy	Patrick	Modelling Masters Relay Swim Team Selection
Hertz	Alain	Resolving sets and integer programs for recommender systems
Kara	İmdat	New formulations for the multiple travelling repairmen problem with time windows
Karakaş	Halil İbrahim	Integer programming formulations for the Frobenius problem
Kilby	Philip	Efficient 3D Packing Without Vertical Overhanging
Kis	Tamás	A branch-and-cut algorithm for the resource loading problem
Klemm	Fabian	Constrained Clustering via Voronoi Diagrams in General Topological Spaces
Knippel	Arnaud	Formulations for the K-partitioning problem
Kononov	Alexander	On the Approximability of the Maximum k-Edge-Colored Clustering Problem
Leung	Janny M.Y.	On the Mixed Set Covering and Packing Polytope
Lopes	Isabel Cristina	Sectorization in elevator maintenance
Łukasiak	Piotr	De novo computational based evaluation of Protein/RNA 3D models using consensus approach
Machowiak	Maciej	The moldable tasks in container port terminal
Mancini	Simona	The Vehicle Routing Problem with Heterogeneous Fleet and Draft Limits
Martinez-Sykora	Antonio	Scheduling for the Growing of Crops to Meet Demand
Miłostan	Maciej	Insights into an analysis of the intra- and intermolecular contacts in and between biomolecules
Mor	Baruch	Flowshop scheduling with learning-effect and job-rejection
Mosheiov	Gur	On hard scheduling problems with generalized due-dates
Müller	David	Tree search based approaches for scheduling flexible job shops incorporating machine operator restrictions
Nikolaev	Andrei	Vertex adjacencies in the traveling salesperson polytope by simulated annealing
Oğuz	Ceyda	A Matheuristic for the Order Acceptance and Scheduling Problem
Ősz	Olivér	A novel MILP model for cyclic scheduling with interlacing
Panagopoulou	Panagiota	Equilibrium Colorings and the Four Color Theorem
Paraskevopoulos	Dimitris	Complex precedence constraints for flexible job shop scheduling problems
Pferschy	Ulrich	Heuristics for the Quadratic TSP
Phusingha	Saranthorn	Tabu Search for Multi-Period Sales Districting Problem
Picouleau	Christophe	Graceful difference labelings of disjoint directed cycles
Qu	Yi	Solving the multi-objective shortest path problem using local search methods
Radom	Marcin	Knockout-based analysis in Stochastic Petri Net models of complex biological systems on the example of atherosclerosis process
Ribeiro	Celso C.	Minimum-Cardinality Balanced Edge Addition in Polarized Networks
Ries	Bernard	Reducing the domination number of graphs via edge contractions
Rodrigues	Ana Maria	Sectorization applied to Routing Problems
Rodrigues	Filipe	Lagrangian duality as a tool to relate approaches for robust problems
Rybarczyk	Agnieszka	The role of YRNA-derived small RNAs in atherosclerosis development and progression – modeled and analyzed using stochastic Petri nets
Schindl	David	On split $B_1$-EPG graphs
Sciriha	Irene	On a Threshold Graph Model for Complex Networks
Sipahioglu	Aydin	Simulated Annealing Algorithm for 1-M-1 Pickup and Delivery Problem
Skorin-Kapov	Darko	Social Enterprise Tree Network Game
Sterna	Malgorzata	Approximation algorithms for early work maximization on two identical machines
Strusevich	Vitaly A.	Scheduling with controllable processing times and a common deadline to minimize maximum compression cost
Świercz	Aleksandra	Searching for patterns in genes during integration of gene expression and copy number variation data
Sylejmani	Kadri	An Iterated Local Search approach for course timetabling with block lectures
Szachniuk	Marta	Consensus-based approach to ranking similar objects
Tüű-Szabó	Boldizsár	Analyzing the performance of Traveling Salesman Problem solver methods
Yang	Boting	The Fast Searching Problem on Cartesian Products of Graphs
Zavalnij	Bogdan	Modeling and solving job shop scheduling problems with graphs and clique search
Zinder	Yakov	Scheduling two-stage jobs processing with limited storage
Last updated on 3 May 2019