Defining the links between retail price strategies and price tactics

Retailers tend to become trapped in a price-promotion war where price issues are dealt with on a short-term basis, indicating almost solely tactical choices. Since price is the only part of the marketing mix providing direct revenues to the organisation, it should also be of strategic importance for the retailer. Not only in practice are price tactics often separated from pricing strategies, it is also the case in research where these are often studied in isolation from each other probably due to their individual complexity. This paper contributes to both the research area and practice by discussing these two complex areas together, and the essence of both strategy and tactics are defined. By considering the planning horizon for the retailer this paper further contributes by defining the links between price strategy and price tactic. The conclusion shows the importance of clearly establishing which analytical level is being analysed.

Optimization of cable cycles : a trade-off between reliability and cost

This paper elaborates the routing of cable cycle through available routes in a building in order to link a set of devices, in a most reasonable way. Despite of the similarities to other NP-hard routing problems, the only goal is not only to minimize the cost (length of the cycle) but also to increase the reliability of the path (in case of a cable cut) which is assessed by a risk factor. Since there is often a trade-off between the risk and length factors, a criterion for ranking candidates and deciding the most reasonable solution is defined. A set of techniques is proposed to perform an efficient and exact search among candidates. A novel graph is introduced to reduce the search-space, and navigate the search toward feasible and desirable solutions. Moreover, admissible heuristic length estimation helps to early detection of partial cycles which lead to unreasonable solutions. The results show that the method provides solutions which are both technically and financially reasonable. Furthermore, it is proved that the proposed techniques are very efficient in reducing the computational time of the search to a reasonable amount.