Economists have traditionally treated preferences as exogenously given. Preferences are assumed to be influenced by neither beliefs nor the constraints people face. As a consequence, changes in behaviour are explained exclusively in terms of changes in the set of feasible alternatives. Here we...

Economists have traditionally treated preferences as exogenously given. Preferences are assumed to be influenced by neither beliefs nor the constraints people face. As a consequence, changes in behaviour are explained exclusively in terms of changes in the set of feasible alternatives. Here we...

Transitivity is perhaps the most fundamental choice axiom and, therefore, almost all economic models assume that preferences are transitive. The empirical literature has regularly documented violations of transitivity, but these violations pose little problem as long as they are simply a result...

Transitivity is perhaps the most fundamental choice axiom and, therefore, almost all economic models assume that preferences are transitive. The empirical literature has regularly documented violations of transitivity, but these violations pose little problem as long as they are simply a result...

Over the years numerous branch-and-bound procedures for solving the resource-constrained project scheduling problem have been developed. Enumerating delaying alternatives, extension alternatives, feasible posets, feasible sequences or feasible subsets, they all aim at finding as fast as possible...

In this paper we present a polynomial time dynamic programming algorithm for solving a scheduling problem with a (total) weighted completion time objective function where the weights are activity- and time-dependent. We highlight application areas for this type of problem to underscore the...

The resource investment problem deals with the issue of providing resources to a project such that a given deadline can be met. The objective is to make the resources available in the cheapest possible way. For each resource, expenses depend on the maximum amount required during the course of...

In project management, the project duration can often be compressed by accelerating some of its activities at an additional expense. This is the so-called time-cost tradeoff problem which has been extensively studied in the past. However, the discrete version of the problem which is of great...

The car sequencing problem is to find feasible sequences of product variants requiring specific options while taking care of sequencing constraints. First, a branching scheme and constraint propagation algorithms for the computation of feasible sequences are provided. Second, an algorithm is...

The Capacitated Facility Location Problem (CFLP) is a well-known combinatorial optimization problem with applications in distribution and production planning. A variety of lower bounds based on Lagrangean relaxation and subgradient optimization has been proposed for this problem. However, in...