Edelweiss Glide

Tan cover with black illustrative line work and bold texthttps://scholarsjunction.msstate.edu/cht-sheet-music/12381/thumbnail.jp

Edelweiss Glide

Illustration of man and woman dancinghttps://scholarsjunction.msstate.edu/cht-sheet-music/12431/thumbnail.jp

Decomposition techniques with mixed integer programming and heuristics for home healthcare planning

We tackle home healthcare planning scenarios in the UK using decomposition methods that incorporate mixed integer programming solvers and heuristics. Home healthcare planning is a difficult problem that integrates aspects from scheduling and routing. Solving real-world size instances of these problems still presents a significant challenge to modern exact optimization solvers. Nevertheless, we propose decomposition techniques to harness the power of such solvers while still offering a practical approach to produce high-quality solutions to real-world problem instances. We first decompose the problem into several smaller sub-problems. Next, mixed integer programming and/or heuristics are used to tackle the sub-problems. Finally, the sub-problem solutions are combined into a single valid solution for the whole problem. The different decomposition methods differ in the way in which subproblems are generated and the way in which conflicting assignments are tackled (i.e. avoided or repaired). We present the results obtained by the proposed decomposition methods and compare them to solutions obtained with other methods. In addition, we conduct a study that reveals how the different steps in the proposed method contribute to those results. The main contribution of this paper is a better understanding of effective ways to combine mixed integer programming within effective decomposition methods to solve real-world instances of home healthcare planning problems in practical computation time

The impact of the prevent duty on schools: a review of the evidence

The UK has emerged as an influential global player in developing policy to counter violent extremism, and therefore it is important to consider the emerging evidence about the impact of this policy in education. The Prevent Duty came into force in the UK in 2015, placing a legal responsibility on schools and teachers to implement anti-terrorist legislation and prevent young people from being drawn into extremism or radicalisation. This article reviews all of the material based on empirical studies in England involving school teachers and students published between 2015 (when the Duty was introduced) and the beginning of 2019 (27 articles and reports in total) to consider the impact of the policy on schools. The key themes emerging from our analysis of this evidence base are related (1) to the ways the policy is interpreted within Islamophobic discourses, (2) the emergence of Britishness as a key feature of fundamental British values, and (3) the implications of framing Prevent as a safeguarding issue. We argue that the evidence gives support to those who have been critical of the Prevent Duty in schools, and that it seems to be generating a number of unintended and negative side effects. However, the evidence also illustrates how teachers have agency in relation to the policy, and may thus be able to enact the policy in ways which reduce some of the most harmful effects

Large-scale optimization with the primal-dual column generation method

The primal-dual column generation method (PDCGM) is a general-purpose column generation technique that relies on the primal-dual interior point method to solve the restricted master problems. The use of this interior point method variant allows to obtain suboptimal and well-centered dual solutions which naturally stabilizes the column generation. As recently presented in the literature, reductions in the number of calls to the oracle and in the CPU times are typically observed when compared to the standard column generation, which relies on extreme optimal dual solutions. However, these results are based on relatively small problems obtained from linear relaxations of combinatorial applications. In this paper, we investigate the behaviour of the PDCGM in a broader context, namely when solving large-scale convex optimization problems. We have selected applications that arise in important real-life contexts such as data analysis (multiple kernel learning problem), decision-making under uncertainty (two-stage stochastic programming problems) and telecommunication and transportation networks (multicommodity network flow problem). In the numerical experiments, we use publicly available benchmark instances to compare the performance of the PDCGM against recent results for different methods presented in the literature, which were the best available results to date. The analysis of these results suggests that the PDCGM offers an attractive alternative over specialized methods since it remains competitive in terms of number of iterations and CPU times even for large-scale optimization problems.Comment: 28 pages, 1 figure, minor revision, scaled CPU time

Edelweiss

Illustration of flowers and mountainshttps://scholarsjunction.msstate.edu/cht-sheet-music/1987/thumbnail.jp

Branching in Branch-and-Price: a Generic Scheme

Developing a branching scheme that is compatible with the column generation procedure can be challenging. Application specific and generic schemes have been proposed in the literature, but they have their drawbacks. One generic scheme is to implement standard branching in the space of the compact formulation to which the Dantzig-Wolfe reformulation was applied. However, in the presence of multiple identical subsystems, the mapping to the original variable space typically induces symmetries. An alternative, in an application specific context, can be to expand the compact formulation to offer a wider choice of branching variables. Other existing generic schemes for use in branch-and-price imply modifications to the pricing problem. This is a concern because the pricing oracle on which the method relies might become obsolete beyond the root node. This paper presents a generic branching scheme in which the pricing oracle of the root node remains of use after branching (assuming that the pricing oracle can handle bounds on the subproblem variables). The scheme does not require the use of an extended formulation of the original problem. It proceeds by recursively partitioning the subproblem solution set. Branching constraints are enforced in the pricing problem instead of being dualized via Lagrangian relaxation, and the pricing problem is solved by a limited number of calls to the pricing oracle. This generic scheme builds on previously proposed approaches and unifies them. We illustrate its use on the cutting stock and bin packing problems. This is the first branch-and-price algorithm capable of solving such problems to integrality without modifying the subproblem or expanding its variable space