Algorithm Engineering in Robust Optimization

Robust optimization is a young and emerging field of research having received a considerable increase of interest over the last decade. In this paper, we argue that the the algorithm engineering methodology fits very well to the field of robust optimization and yields a rewarding new perspective on both the current state of research and open research directions. To this end we go through the algorithm engineering cycle of design and analysis of concepts, development and implementation of algorithms, and theoretical and experimental evaluation. We show that many ideas of algorithm engineering have already been applied in publications on robust optimization. Most work on robust optimization is devoted to analysis of the concepts and the development of algorithms, some papers deal with the evaluation of a particular concept in case studies, and work on comparison of concepts just starts. What is still a drawback in many papers on robustness is the missing link to include the results of the experiments again in the design

A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs

Bilevel optimization problems are very challenging optimization models arising in many important practical contexts, including pricing mechanisms in the energy sector, airline and telecommunication industry, transportation networks, critical infrastructure defense, and machine learning. In this paper, we consider bilevel programs with continuous and discrete variables at both levels, with linear objectives and constraints (continuous upper level variables, if any, must not appear in the lower level problem). We propose a general-purpose branch-and-cut exact solution method based on several new classes of valid inequalities, which also exploits a very effective bilevel-specific preprocessing procedure. An extensive computational study is presented to evaluate the performance of various solution methods on a common testbed of more than 800 instances from the literature and 60 randomly generated instances. Our new algorithm consistently outperforms (often by a large margin) alternative state-of-the-art methods from the literature, including methods exploiting problem-specific information for special instance classes. In particular, it solves to optimality more than 300 previously unsolved instances from the literature. To foster research on this challenging topic, our solver is made publicly available online

An exact method for binary fortification games

A fortification game (FG) is a three-level, two-player hierarchical game, also known as defender-attacker- defender game, in which at the uppermost level, the defender selects some assets to be protected from potential malicious attacks. At the middle level, the attacker solves an interdiction game by depreciating unprotected assets, i.e., reducing the values of such assets for the defender, while at the innermost level the defender solves a recourse problem over the surviving or partially damaged assets. Fortification games have applications in various important areas, such as military operations, design of survivable networks, protection of facilities or power grid protection. In this work, we present an exact solution algorithm for FGs, in which the recourse problems correspond to (possibly NP-hard) combinatorial optimization prob- lems. The algorithm is based on a new generic mixed-integer linear programming reformulation in the natural space of fortification variables. Our new model makes use of fortification cuts that measure the contribution of a given fortification strategy to the objective function value. These cuts are generated when needed by solving separation problems, which correspond to (modified) middle-level interdiction games. We design a branch-and-cut-based solution algorithm based on fortification cuts, their strength- ened versions and other speed-up techniques. We present a computational study using the knapsack for- tification game and the shortest path fortification game. For the latter one, we include a comparison with a state-of-the-art solution method from the literature. Our algorithm outperforms this method and allows us to solve previously unsolved instances with up to 330 386 nodes and 1 202 458 arcs to optimality

Laparotomic intrauterine insemination with frozen-thawed semen in Sopravissana breed ewes in Central Italy

Intrauterine laparoscopic insemination is diffuse in sheep breeding, yet requires veterinary expertise and expensive equipment. Our aim was to evaluate the time required, reproductive outcome and post-operative complications of mini invasive laparotomic intrauterine insemination, as an alternative approach to laparoscopy. A total of 115 Sopravvissana breed ewes were enrolled, including 75 adults and 40 lamb ewes, after oestrus synchronisation. Ewes were sedated and restrained in dorsal recumbence. Uterine horns were exposed through an abdominal incision of 4\u20137 cm, cranially to the udder. Thawed semen, containing 100 7 106 progressive motile (70%) and morphologically normal (80%) sperm cells, was inoculated into uterine lumen through an intravenous catheter. The abdominal incision was then routinely closed. The time interval for: (a) laparotomy and uterine exteriorisation, (b) intrauterine insemination, (c) abdominal wall closure and (d) total procedure was recorded. Pregnancy, lambing, twinning rates and sex ratio were submitted to chi-square test, comparing lamb and adult ewes. Time intervals and the duration of laparotomic procedure were compared in lamb and adults through Mann\u2013Whitney U test for independent samples. Median \ub1 standard error (SE) of total time for laparotomic intrauterine insemination was 5.53 \ub1 0.07 and 4.99 \ub1 0.11 min, for adult and lamb ewes (p<.05), which was similar to what was reported for laparoscopic methods. At pregnancy check, 60% and 70% of adult and lamb ewes resulted pregnant. Laparotomy is poorly applied due to risk of adherence and decreased fertility. In our study, ewes were naturally bred in the following season with 90% pregnancy rate. Our results showed that time for laparotomy is quite similar to laparoscopic insemination, as for the conception and lambing rates.HIGHLIGHTS Time required for the overall procedure (5.53 \ub1 0.07 and 4.99 \ub1 0.11 min, for adult and lamb ewes, respectively, with significant difference (p<.05)) was similar to laparoscopic artificial insemination. About 60% and 70% of adult and lamb ewes resulted pregnant, respectively. No decreased fertility was observed in the following breeding season (90% pregnancy rate at natural insemination). Laparotomic approach is quite similar to laparoscopic insemination, in terms of time required for its complete achievement, for the conception and lambing rates; furthermore it has the advantage of reducing equipment costs

Music Teacher Education at a Liberal Arts College

In 2012, a committee at a small Midwestern liberal arts college, Lake Forest College, embarked on a journey to create a music education teacher licensure major. Drawing from narrative inquiry, this article reports how the dean of faculty, education department chair, music department chair, and assistant professor of music/music education coordinator collaborated on a curricular creation. Findings from this process included (a) the created music education major, (b) each participant’s rationale for wanting the new music education major, (c) valued components of the music education major, and (d) unique elements of a music education major at a liberal arts college. Implications from this experience could be valuable for music education programs at small liberal arts colleges, those involved in university/school partnerships such as professional development schools, and those looking to advocate for their music education programs across campus

Food labeling issues for severe food allergic patients

Food allergy carries high importance and responsibility, affecting an estimated 220 million people worldwide. It is a frequent cause of food-induced anaphylaxis, a life-threatening condition requiring a toll of about one death per 50 million people a year worldwide. In order to help patients to identify allergenic foods and thus avoid anaphylactic reactions, 66 countries over the 5 continents require by law that allergenic ingredients must be declared when used in prepackaged foods. Unfortunately, the mandatory allergen list is not uniform, but varies among different countries. The widespread adoption of Precautionary Allergen Labeling (PAL) results in a proliferation of unregulated PALs with different informative statements. In this situation, the need of a scientific consensus on the definition of food allergy and the identification of a tolerable risk with routinely used detection assays, considering not only the eliciting dose but also the food source, is urgent. The aim of this manuscript is: 1) to draw a picture of the global situation in terms of PALs, and 2) to highlight new approaches that could aid in tackling the problem of regulating the labeling of allergens. These include the Voluntary Incidental Trace Allergen Labelling (VITAL) system, which intersects reference doses and labelling decisions, and a direct quantification of trace amounts of allergens at lower limit of detection (LOD) levels in the food itself through proteomics. We here highlight how, although with some limitations, the steady advances in proteomic approaches possess higher sensitivity than the recommended VITAL reference doses, allowing the identification of allergens at much lower LOD levels than VITAL. Considering that each assay used to detect allergen in food products carries method-specific issues, a more comprehensive and harmonized approach implementing both quantitative and qualitative methods could help overcoming the risk stratification approach and the overuse of PALs, offering promise as the field moves forward towards improving consumers’ quality of life

Hypoxia shapes autophagy in LPS-activated dendritic cells

During their lifespan, dendritic cells (DCs) are exposed to different pO2 levels that affect their differentiation and functions. Autophagy is one of the adaptive responses to hypoxia with important implications for cell survival. While the autophagic machinery in DCs was shown to impact signaling of TLRs, its regulation by the MD-2/TLR4 ligand LPS is still unclear. The aim of this study was to evaluate whether LPS can induce autophagy in DCs exposed to either aerobic or hypoxic conditions. Using human monocyte-derived DCs and the combination of immunofluorescence confocal analysis, measure of mitochondrial membrane potential, Western blotting, and RT-qPCR, we showed that the ability of LPS to modulate autophagy was strictly dependent upon pO2 levels. Indeed, LPS inhibited autophagy in aerobic conditions whereas the autophagic process was induced in a hypoxic environment. Under hypoxia, LPS treatment caused a significant increase of functional lysosomes, LC3B and Atg protein upregulation, and reduction of SQSTM1/p62 protein levels. This selective regulation was accompanied by activation of signalling pathways and expression of cytokines typically associated with DC survival. Bafilomycin A1 and chloroquine, which are recognized as autophagic inhibitors, confirmed the induction of autophagy by LPS under hypoxia and its impact on DC survival. In conclusion, our results show that autophagy represents one of the mechanisms by which the activation of the MD-2/TLR4 ligand LPS promotes DC survival under hypoxic conditions