Showing 1 - 10 of 12,308
will present a general mathematical programming algorithm which can be applied to find an element in the interval core. As …
Persistent link: https://www.econbiz.de/10010421344
-called peer group games being non-negative additive games on a permission tree. We provide a polynomial time algorithm for …
Persistent link: https://www.econbiz.de/10010325798
. Therefore a combinatorial optimisation algorithm is developed and an algorithm based on graph search is used and customised … correctness of the quick combinatorial algorithm are proved within this paper. For vehicle to grid (V2G) concepts, battery … been used to include degradation costs for different Li-Ion batteries into the graph search algorithm. An application of …
Persistent link: https://www.econbiz.de/10010300726
prove this we use a simplicial algorithm that terminates with a zero point within a finite number of iterations. The …
Persistent link: https://www.econbiz.de/10010325776
Prefetching is a simple and general method for single-chain parallelisation of the Metropolis-Hastings algorithm based … random walk Metropolis-Hastings algorithm is obtained for a special case and it is shown to decrease in the number of …
Persistent link: https://www.econbiz.de/10010281448
Sales force management decisions belong to the major issues considered in marketing research. Among others, the alignment of sales territories has been one of the main field of work for years. Recent results have reported a strong impact of the alignment of sales territories on profit, and,...
Persistent link: https://www.econbiz.de/10011558753
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...
Persistent link: https://www.econbiz.de/10011558760
We consider a model of an information network where nodes can fail and transmission of information is costly. The formation of paths in such networks is modeled as the Nash equilibrium of an N player routing game. The task of obtaining this equilibrium is shown to be NP-Hard. We derive...
Persistent link: https://www.econbiz.de/10010274309
This paper presents and exemplifies results developed for cointegration analysis with state space models by Bauer and Wagner in a series of papers. Unit root processes, cointegration and polynomial cointegration are defined. Based upon these definitions the major part of the paper discusses how...
Persistent link: https://www.econbiz.de/10010294007
or quarters containing more information than others). We suggest an algorithm that performs an approximate inversion of …
Persistent link: https://www.econbiz.de/10010294045