In this paper we propose a three–level computational equilibrium model that allows to analyze the impact of the regulatory environment on transmission line expansion (by the regulator) and investment in generation capacity (by private firms) in liberalized electricity markets. The basic...

We will present a theoretical model for an integrated planning of Eucharistic masses and Liturgies of the Word assuming different priests, assistant priests and lay persons. This all-integer vector optimization problem can be seen as an economic, spacial and inter-temporal resource allocation...

A new evaluation scheme for universal mobile telecommunications system (UMTS) radio networks is introduced. The approach takes the complex coupling of coverage and capacity through interference into account. Cell load estimates, otherwise obtained through Monte-Carlo simulation, can now be...

In this paper we present a simulated annealing approach for the gas network optimization problem. A gas network consists of a set of pipes to transport the gas from the sources to the sinks whereby gas pressure gets lost due to friction. Further on there are compressors, which increase gas...

In this paper we propose a three-level computational equilibrium model that allows to analyze the impact of the regulatory environment on transmission line expansion (by the regulator) and investment in generation capacity (by private firms) in liberalized electricity markets. The basic model...

We introduce a mixed integer linear modeling approach for the optimization of dynamic transport networks based on the piecewise linearization of nonlinear constraints and we show how to apply this method by two examples, transient gas and water supply network optimization. We state the mixed...

A new evaluation scheme for universal mobile telecommunications system (UMTS) radio networks is introduced. The approach takes the complex coupling of coverage and capacity through interference into account. Cell load estimates, otherwise obtained through Monte-Carlo simulation, can now be...

We investigate the problem of partitioning the nodes of a graph under capacity restriction on the sum of the node weights in each subset of the partition. The objective is to minimize the sum of the costs of the edges between the subsets of the partition. This problem has a variety of...

This survey presents cutting planes that are useful or potentially useful in solving mixed integer programs. Valid inequalities for i) general integer programs, ii) problems with local structure such as knapsack constraints, and iii) problems with 0-1 coefficient matrices, such as set packing,...