The Stackelberg pricing problem has two levels of decision making: tariff setting by an operator, and then selection of the cheapest alternative by customers. In the network version, an operator determines tariffs on a subset of the arcs that he owns. Customers, who wish to connect two vertices...

In this paper we recognize that reforms of the welfare state can be necessary from an economic point of view. We stress, however, that these reforms also have important social and political dimensions. The social dimensions are conceptualised by using Hofstede''s cultural characteristics. The...

To study non-durable import demand, we extend previous work done by Clarida (1994) and Ceglowski (1991) by considering a two-good version of the life cycle model in which we introduce time-nonseparability in the households'' preferences. The model is estimated using quarterly data for US and...

The frequency assignment problem (FAP) is the problem of assigning frequencies to transmission links such that no interference between signals occurs. This implies distance constraints between assigned frequencies of links. The objective is to minimize the number of used frequencies. We present...

In this paper the partial constraint satisfaction problem (PCSP) is introduced and formulated as a {0,1}-programming problem. We define the partial constraint satisfaction polytope as the convex hull of feasible solutions for this programming problem. As examples of the class of problems studied...

This paper considers the precedence constrained knapsack problem. More specifically, we are interested in classes of valid inequalities which are facet-defining for the precedence constrained knapsack polytope. We study the complexity of obtaining these facets using the standard sequential...

This paper proposes a new method for probabilistic analysis of online algorithms that is based on the notion of stochastic dominance. We develop the method for the Online Bin Coloring problem introduced by Krumke et al. Using methods for the stochastic comparison of Markov chains we establish...

In this paper we consider an ILP-based approach to tackle the problem of determining a treewidth of the graph. We give an overview of existing attempts and develop further LP-based techniques for the problem. We present two different ILP formulations for the treewidth. To obtain the first one we...