We provide two different neighborhood construction techniques for creating exponentially large neighborhoods that are searchable in polynomial time using dynamic programming. We illustrate both of these approaches on very large scale neighborhood search techniques for the traveling salesman...

In spite of a manager's best attempts, a managed rangeland may hit an irreversible state in which it provides neither consumptive nor non-consumptive services to humans. Therefore, given a particular time based management regime, it is useful to know how long it takes for a rangeland to hit the...

We consider the problem of estimating the unknown breakpoints in segmented generalized linear models. Exact algorithms for calculating maximum likelihood estimators are derived for different types of models. After discussing the case of a GLM with a single covariate having one breakpoint a new...

We derive empirical tests for the stochastic dominance efficiency of a given portfolio with respect to all possible portfolios constructed from a set of assets. The tests can be computed using straightforward linear programming. Bootstrapping techniques and asymptotic distribution theory can...

We obtain minimax lower bounds on the regret for the classical two--armed bandit problem. We provide a finite--sample minimax version of the well--known log "n" asymptotic lower bound of Lai and Robbins. Also, in contrast to the log "n" asymptotic results on the regret, we show that the minimax...

Local search algorithms for combinatorial optimization problems are in general of pseudopolynomial running time and polynomial-time algorithms are often not known for finding locally optimal solutions for NP-hard optimization problems. We introduce the concept of epsilon-local optimality and...

The informational fl ow between oil and spot freight markets is examined in a novel way via the time charter equivalent (TCE) to identify statistical arbitrage trading opportunities. Using Brent and TD3 data, synthetic floating storage positions are constructed, which are shown to be...

Bereits seit mehreren Jahrzehnten findet die Optimierung in der akademischen Lehre und Forschung starke Beachtung. Trotz der Breite potenzieller Anwendungsfelder gibt es jedoch einige methodische Schwierigkeiten. Das Hauptproblem besteht darin, die Unsicherheit, d.h. stochastische Prozesse von...

In this paper we explore whether the incorporation of systematic time series analyses and mathematical optimization procedures in the practical planning process has the potential to improve production program decisions. The cases of four German cash crop farms are investigated over six planning...

Mathematical programming has for a long time been recognized as a powerful tool. Despite its capacity for solving constrained optimization problems under uncertainty, some methodological obstacles have persisted over the years. The main problem is that the eventually complex results of an...