Weighted stability number of graphs and weighted satisfiability: The two facets of pseudo-Boolean optimization

We exhibit links between pseudo-Boolean optimization, graph theory and logic. We show the equivalence of maximizing a pseudo-Boolean function and finding a maximum weight stable set; symmetrically minimizing a pseudo-Boolean function is shown to be equivalent to solving a weighted satisfiability proble

On Split-Coloring Problems

We study a new coloring concept which generalizes the classical vertex coloring problem in a graph by extending the notion of stable sets to split graphs. First of all, we propose the packing problem of finding the split graph of maximum size where a split graph is a graph G = (V,E) in which the vertex set V can be partitioned into a clique K and a stable set S. No condition is imposed on the edges linking vertices in S to the vertices in K. This maximum split graph problem gives rise to an associated partitioning problem that we call the split-coloring problem. Given a graph, the objective is to cover all his vertices by a least number of split graphs. Definitions related to this new problem are introduced. We mention some polynomially solvable cases and describe open questions on this are

Comparing league formats with respect to match importance in Belgian football

Recently, most clubs in the highest Belgian football division have become convinced that the format of their league should be changed. Moreover, the TV station that broadcasts the league is pleading for a more attractive competition. However, the clubs have not been able to agree on a new league format, mainly because they have conflicting interests. In this paper, we compare the current league format, and three other formats that have been considered by the Royal Belgian Football Association. We simulate the course of each of these league formats, based on historical match results. We assume that the attractiveness of a format is determined by the importance of its games; our importance measure for a game is based on the number of teams for which this game can be decisive to reach a given goal. Furthermore, we provide an overview of how each league format aligns with the expectations and interests of each type of club

Solving the Sports League Scheduling Problem with Tabu Search

In this paper we present a tabu approach for a version of the Sports League Scheduling Problem. The approach adopted is based on a formulation of the problem as a Constraint Satisfaction Problem (CSP). Tests were carried out on problem instances of up to 40 teams representing 780 integer variables with 780 values per variable. Experimental results show that this approach outperforms some existing methods and is one of the most promising methods for solving problems of this type

A stochastic local search algorithm with adaptive acceptance for high-school timetabling

Automating high school timetabling is a challenging task. This problem is a well known hard computational problem which has been of interest to practitioners as well as researchers. High schools need to timetable their regular activities once per year, or even more frequently. The exact solvers might fail to find a solution for a given instance of the problem. A selection hyper-heuristic can be defined as an easy-to-implement, easy-to-maintain and effective 'heuristic to choose heuristics' to solve such computationally hard problems. This paper describes the approach of the team hyper-heuristic search strategies and timetabling (HySST) to high school timetabling which competed in all three rounds of the third international timetabling competition. HySST generated the best new solutions for three given instances in Round 1 and gained the second place in Rounds 2 and 3. It achieved this by using a fairly standard stochastic search method but significantly enhanced by a selection hyper-heuristic with an adaptive acceptance mechanism. © 2014 Springer Science+Business Media New York

Verifying the chronology of Ukrainian Neolithic

This paper addresses the earliest Neolithic phases in Ukraine: aspects relating to the chronology, methods and time of Neolithisation. In general, the earliest Neolithisation relates to the times of the Linear Pottery culture. Nevertheless, Ukraine has numerous eco-zones so the process could have been different in other zones. The authors emphasize that the key to getting closer to solving this problem is the chronology-re-dating and validation program. Hitherto dates of one culture or period of culture have been treated against each other. This article presents a small series of AMS from well-defined contexts of four sites, previously dated by the Kyiv radiocarbon facility. The results are compared with existing dates in order to establish the validity of existing chronologies for the Neolithic of Ukraine. Obtained results allowed the authors to conclude that the Kyiv dates should not be obligatorily treated as wrong. Furthermore, the authors reopened the discussion to establish what was the role of LBK and Azov-Dnieper culture communities in spreading farming and herding in Ukraine during the second half of the VIth millennium BC

Hybridising heuristics within an estimation distribution algorithm for examination timetabling

This paper presents a hybrid hyper-heuristic approach based on estimation distribution algorithms. The main motivation is to raise the level of generality for search methodologies. The objective of the hyper-heuristic is to produce solutions of acceptable quality for a number of optimisation problems. In this work, we demonstrate the generality through experimental results for different variants of exam timetabling problems. The hyper-heuristic represents an automated constructive method that searches for heuristic choices from a given set of low-level heuristics based only on non-domain-specific knowledge. The high-level search methodology is based on a simple estimation distribution algorithm. It is capable of guiding the search to select appropriate heuristics in different problem solving situations. The probability distribution of low-level heuristics at different stages of solution construction can be used to measure their effectiveness and possibly help to facilitate more intelligent hyper-heuristic search methods

Consensus on circulatory shock and hemodynamic monitoring. Task force of the European Society of Intensive Care Medicine.

OBJECTIVE: Circulatory shock is a life-threatening syndrome resulting in multiorgan failure and a high mortality rate. The aim of this consensus is to provide support to the bedside clinician regarding the diagnosis, management and monitoring of shock. METHODS: The European Society of Intensive Care Medicine invited 12 experts to form a Task Force to update a previous consensus (Antonelli et al.: Intensive Care Med 33:575-590, 2007). The same five questions addressed in the earlier consensus were used as the outline for the literature search and review, with the aim of the Task Force to produce statements based on the available literature and evidence. These questions were: (1) What are the epidemiologic and pathophysiologic features of shock in the intensive care unit ? (2) Should we monitor preload and fluid responsiveness in shock ? (3) How and when should we monitor stroke volume or cardiac output in shock ? (4) What markers of the regional and microcirculation can be monitored, and how can cellular function be assessed in shock ? (5) What is the evidence for using hemodynamic monitoring to direct therapy in shock ? Four types of statements were used: definition, recommendation, best practice and statement of fact. RESULTS: Forty-four statements were made. The main new statements include: (1) statements on individualizing blood pressure targets; (2) statements on the assessment and prediction of fluid responsiveness; (3) statements on the use of echocardiography and hemodynamic monitoring. CONCLUSIONS: This consensus provides 44 statements that can be used at the bedside to diagnose, treat and monitor patients with shock

Comparison of bioinspired algorithms applied to the timetabling problem

The problem of timetabling events is present in various organizations such as schools, hospitals, transportation centers. The purpose of timetabling activities at a university is to ensure that all students attend their required subjects in accordance with the available resources. The set of constraints that must be considered in the design of timetables involves students, teachers and infrastructure. This study shows that acceptable solutions are generated through the application of genetic, memetic and immune system algorithms for the problem of timetabling. The algorithms are applied to real instances of the University of Mumbai in India and their results are comparable with those of a human expert