Showing 1 - 10 of 12,384
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
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
heuristics do better. In priority rule-based scheduling, attempts to remedy this have been made by combining simple priority … sampling stage; the arising algorithm is almost as effective as the most effective construction methods currently known, and it …
Persistent link: https://www.econbiz.de/10011558738
individuals use simple rules of thumb (heuristics) to forecast the future inflation and output gap. We compare this model with the …
Persistent link: https://www.econbiz.de/10011604943
. 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
This paper addresses the robust spanning tree problem with interval data, i.e. the case of classical minimum spanning tree problem when edge weights are not fixed but take their values from some intervals associated with edges. The problem consists in finding a spanning tree that minimizes...
Persistent link: https://www.econbiz.de/10011558802
This paper addresses the robust shortest path problem with interval data, i.e. the case of classical shortest path problem with given source and sink when arc weights are not fixed but take their values from some intervals associated with arcs. The problem consists in finding a shortest path...
Persistent link: https://www.econbiz.de/10011558808