In 1997 two papers_new applying the metaheuristics Tabu Search (TS) and Heuristic Concentration (HC) tothe p-median problem were published in consecutive volumes of the European Journal of OperationalResearch. Here we apply the method of HC some of the data sets which were used for...

Combined forecasts from a linear and a nonlinear model areinvestigated for timeseries with possibly nonlinear characteristics. The forecasts arecombined by aconstant coefficient regression method as well as a time varyingmethod. Thetime varying method allows for a locally (non)linear model....

Contemporary financial stochastic programs typically involve a trade-offbetween return and (downside)-risk. Using stochastic programming we characterize analytically (rather than numerically) the optimal decisions that follow from characteristic single-stage and multi-stage versions of such...

Pure time series-based tests fail to find empirical support formonetary exchange rate models. In this paper we apply pooled timeseries estimation on a forward-looking monetary model, resulting inparameter estimates which are in compliance with the underlyingtheory. Based on a panel version of...

In this paper we consider optimization problems defined by a quadraticobjective function and a finite number of quadratic inequality constraints.Given that the objective function is bounded over the feasible set, we presenta comprehensive study of the conditions under which the optimal solution...

In this paper, we make use of state space models to investigate the presence of stochastic trends in economic time series. A model is specified where such a trend can enter either in the autoregressive representation or in a separate state equation. Tests based on the former are analogous to...

In this paper we will describe a Multi-Agent System which iscapable of finding a feasible solution of a specially structuredlinear programming problem. Emphasis is given to correctnessissues and termination detection.

In this paper we introduce the STAR-STGARCH model that can characterizenonlinear behaviour both in the conditional mean and the conditionalvariance. A modelling cycle for this family of models, consisting ofspecification, estimation, and evaluation stages is constructed.Misspecification tests...

We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min-sum or min-max objective function. Our algorithms run in polynomial time if the optimization problem itself is polynomially solvable. We also extend our results...