Helmut Simonis
YOU?
Author Swipe
View article: Multiperiod vaccination facility planning
Multiperiod vaccination facility planning Open
We propose a decision support tool, based on Mixed Integer Programming, to help with the planning of national vaccination campaigns, and test it on data and scenarios obtained from the publicly available information about the Irish COVID-1…
View article: Survey of Methods, Resources, and Formats for Teaching Constraint Programming
Survey of Methods, Resources, and Formats for Teaching Constraint Programming Open
This paper provides an overview of the state of teaching for Constraint Programming, based on a survey of the community for the 2023 Workshop on Teaching Constraint Programming at the CP 2023 conference in Toronto. The paper presents the r…
View article: GAC for a Linear Inequality and an Atleast Constraint with an Application to Learning Simple Polynomials
GAC for a Linear Inequality and an Atleast Constraint with an Application to Learning Simple Polynomials Open
We provide a filtering algorithm achieving GAC for the conjunction of constraints atleast (b, [x(0),x(1),...,x(n-1)], V) and (a(0)*x(0) +...+ a(n-1)*x(n-1)) <= c, where the atleast constraint enforcesb variables out of x(0), x(1), ..., x(n…
View article: Dataset for Article: Hybrid Flexible Flowshop with Transportation Times at CP 2021
Dataset for Article: Hybrid Flexible Flowshop with Transportation Times at CP 2021 Open
This dataset contains the benchmark data used for the article "Hybrid Flexible Flowshop with Transportation Times" to appear at the 27th International Conference on Principles and Practice of Constraint Programming in Montpellier, France, …
View article: Dataset for Article: Hybrid Flexible Flowshop with Transportation Times at CP 2021
Dataset for Article: Hybrid Flexible Flowshop with Transportation Times at CP 2021 Open
This dataset contains the benchmark data used for the article "Hybrid Flexible Flowshop with Transportation Times" to appear at the 27th International Conference on Principles and Practice of Constraint Programming in Montpellier, France, …
View article: PTHG21 Challenge
PTHG21 Challenge Open
In this document we introduce the PTHG21 Challenge, a series of constraint acquisition problems. We describe the organization of the challenge, the format of the data provided, and the result format that should be used. The required data a…
View article: PTHG21 Challenge
PTHG21 Challenge Open
In this document we introduce the PTHG21 Challenge, a series of constraint acquisition problems. We describe the organization of the challenge, the format of the data provided, and the result format that should be used. The required data a…
View article: The Hybrid Flexible Flowshop with Transportation Times
The Hybrid Flexible Flowshop with Transportation Times Open
This paper presents the hybrid, flexible flowshop problem with transportation times between stages, which is an extension of an existing scheduling problem that is well-studied in the literature. We explore different models for the problem…
View article: Synthesising a Database of Parameterised Linear and Non-Linear Invariants for Time-Series Constraints
Synthesising a Database of Parameterised Linear and Non-Linear Invariants for Time-Series Constraints Open
Many constraints restricting the result of some computations over an integer sequence can be compactly represented by register automata. We improve the propagation of the conjunction of such constraints on the same sequence by synthesising…
View article: The Inductive Constraint Programming Loop
The Inductive Constraint Programming Loop Open
Constraint programming is used for a variety of real-world optimization problems, such as planning, scheduling, and resource allocation problems, all while we continuously gather vast amounts of data about these problems. Current constrain…
View article: Beyond the Holy Grail - Automatically Generating Constraint Propagators for Conjunctions of Time-Series Constraints
Beyond the Holy Grail - Automatically Generating Constraint Propagators for Conjunctions of Time-Series Constraints Open
The Holy Grail of programming was described in [7] as the separation of modelling which problem we want to solve, and the application of a tool (a Constraint Solver) to provide a solution from the model. This requires a sophisticated syste…
View article: Deriving Generic Bounds for Time-Series Constraints Based on Regular Expressions Characteristics
Deriving Generic Bounds for Time-Series Constraints Based on Regular Expressions Characteristics Open
We introduce the concept of regular expression characteristics as a unified way to concisely express bounds on time-series constraints. This allows us not only to define time-series constraints in a compositional way, but also to deal with…
View article: Bin Packing with Linear Usage Costs -- An Application to Energy Management in Data Centres
Bin Packing with Linear Usage Costs -- An Application to Energy Management in Data Centres Open
EnergeTIC is a recent industrial research project carried out in Grenoble on optimizing energy consumption in data-centres. The efficient management of a data-centre involves minimizing energy costs while ensuring service quality. We study…
View article: Global Constraint Catalog, Volume II, Time-Series Constraints
Global Constraint Catalog, Volume II, Time-Series Constraints Open
First this report presents a restricted set of finite transducers used to synthesise structural time-series constraints described by means of a multi-layered function composition scheme. Second it provides the corresponding synthesised cat…
View article: Optimizing Energy Costs in a Zinc and Lead Mine
Optimizing Energy Costs in a Zinc and Lead Mine Open
Boliden Tara Mines Ltd. consumed 184.7 GWh of electricity in 2014, equating to over 1% of the national demand of Ireland or approximately 35,000 homes. Ireland’s industrial electricity prices, at an average of 13 c/KWh in 2014, are amongst…
View article: The Inductive Constraint Programming Loop
The Inductive Constraint Programming Loop Open
Constraint programming is used for a variety of real-world optimisation problems, such as planning, scheduling and resource allocation problems. At the same time, one continuously gathers vast amounts of data about these problems. Current …
View article: Bin Packing with Linear Usage Costs
Bin Packing with Linear Usage Costs Open
Bin packing is a well studied problem involved in many applications. The classical bin packing problem is about minimising the number of bins and ignores how the bins are utilised. We focus in this paper, on a variant of bin packing that i…