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...

The asymmetric moving average model (asMA) is extended to allow forasymmetric quadratic conditional heteroskedasticity (asQGARCH). Theasymmetric parametrization of the conditional variance encompassesthe quadratic GARCH model of Sentana (1995). We introduce a framework fortesting asymmetries in...

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...

Tests for structural stability with unknown breakpoint are derived for and applied tothe efficient method of moments. Three types of tests are discerned: Wald type tests,Predictive tests and Hansen type tests. The Hansen type test for structural stabilitywith unknown breakpoint is a novelty for...

Exchange rates typically exhibit time-varying patterns in both means andvariances. The histograms of such series indicate heavy tails. In thispaper we construct models which enable a decision-maker to analyze theimplications of such time series patterns for currency risk management.Our approach...

In this paper we compare the predictive abilility of Stochastic Volatility (SV)models to that of volatility forecasts implied by option prices. We develop anSV model with implied volatility as an exogeneous var able in the varianceequation which facilitates the use of statistical tests for...

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 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.

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...

A necessary condition - the Principle of Fermat-Lagrange - is offered for mixed smooth-convexoptimization problems. This generalizes and unifies most of the known necessary conditions forconcrete finite and infinite dimensional optimization problems of interest. The new idea in comparisonwith...