TY - JOUR A1 - Maher, Stephen J. T1 - Solving the integrated airline recovery problem using column-and-row generation JF - Transportation Science N2 - Airline recovery presents very large and difficult problems requiring high quality solutions within very short time limits. To improve computational performance, the complete airline recovery problem is generally formulated as a series of sequential stages. While the sequential approach greatly simplifies the complete recovery problem, there is no guarantee of global optimality or solution quality. To address this, there has been increasing interest in the development of efficient solution techniques to solve an integrated recovery problem. In this paper, an integrated airline recovery problem is proposed by integrating the schedule, crew and aircraft recovery stages. To achieve short runtimes and high quality solutions, this problem is solved using column-and-row generation. Column-and-row generation achieves an improvement in solution runtimes by reducing the problem size and thereby achieving a faster execution of each LP solve. Further, the results demonstrate that a good upper bound achieved early in the solution process, indicating an improved solution quality with the early termination of the algorithm. This paper also details the integration of the row generation procedure with branch-and-price, which is used to achieve integral optimal solutions. The benefits of applying column-and-row generation to solve the integrated recovery problem are demonstrated with a comparison to a standard column generation technique. Y1 - 2015 U6 - https://doi.org/10.1287/trsc.2014.0552 VL - 50 IS - 1 SP - 216 EP - 239 ER - TY - JOUR A1 - Vigerske, Stefan A1 - Gleixner, Ambros T1 - SCIP: Global Optimization of Mixed-Integer Nonlinear Programs in a Branch-and-Cut Framework JF - Optimization Methods & Software N2 - This paper describes the extensions that were added to the constraint integer programming framework SCIP in order to enable it to solve convex and nonconvex mixed-integer nonlinear programs (MINLPs) to global optimality. SCIP implements a spatial branch-and-bound algorithm based on a linear outer-approximation, which is computed by convex over- and underestimation of nonconvex functions. An expression graph representation of nonlinear constraints allows for bound tightening, structure analysis, and reformulation. Primal heuristics are employed throughout the solving process to find feasible solutions early. We provide insights into the performance impact of individual MINLP solver components via a detailed computational study over a large and heterogeneous test set. Y1 - 2018 U6 - https://doi.org/10.1080/10556788.2017.1335312 VL - 33 IS - 3 SP - 563 EP - 593 ER - TY - JOUR A1 - Maher, Stephen J. A1 - Murray, John M. T1 - The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences JF - European Journal of Operational Research N2 - This paper presents a novel application of operations research techniques to the analysis of HIV Env gene sequences, aiming to identify key features that are possible vaccine targets. These targets are identified as being critical to the transmission of HIV by being present in early transmitted (founder) sequences and absent in later chronic sequences. Identifying the key features of Env involves two steps: first, calculating the covariance of amino acid combinations and positions to form a network of related and compensatory mutations; and second, developing an integer program to identify the smallest connected subgraph of the constructed covariance network that exhibits a set covering property. The integer program developed for this analysis, labelled the unrooted set covering connected subgraph problem (USCCSP), integrates a set covering problem and connectivity evaluation, the latter formulated as a network flow problem. The resulting integer program is very large and complex, requiring the use of Benders' decomposition to develop an efficient solution approach. The results will demonstrate the necessity of applying acceleration techniques to the Benders' decomposition solution approach and the effectiveness of these techniques and heuristic approaches for solving the USCCSP. Y1 - 2016 U6 - https://doi.org/doi:10.1016/j.ejor.2015.07.011 VL - 248 IS - 2 SP - 668 EP - 680 ER - TY - JOUR A1 - Gamrath, Gerald A1 - Koch, Thorsten A1 - Martin, Alexander A1 - Miltenberger, Matthias A1 - Weninger, Dieter T1 - Progress in presolving for mixed integer programming JF - Mathematical Programming Computation N2 - This paper describes three presolving techniques for solving mixed integer programming problems (MIPs) that were implemented in the academic MIP solver SCIP. The task of presolving is to reduce the problem size and strengthen the formulation, mainly by eliminating redundant information and exploiting problem structures. The first method fixes continuous singleton columns and extends results known from duality fixing. The second analyzes and exploits pairwise dominance relations between variables, whereas the third detects isolated subproblems and solves them independently. The performance of the presented techniques is demonstrated on two MIP test sets. One contains all benchmark instances from the last three MIPLIB versions, while the other consists of real-world supply chain management problems. The computational results show that the combination of all three presolving techniques almost halves the solving time for the considered supply chain management problems. For the MIPLIB instances we obtain a speedup of 20 % on affected instances while not degrading the performance on the remaining problems. Y1 - 2015 U6 - https://doi.org/10.1007/s12532-015-0083-5 VL - 7 IS - 4 SP - 367 EP - 398 ER - TY - JOUR A1 - Bestuzheva, Ksenia A1 - Besançon, Mathieu A1 - Chen, Wei-Kun A1 - Chmiela, Antonia A1 - Donkiewicz, Tim A1 - Doornmalen, Jasper A1 - Eifler, Leon A1 - Gaul, Oliver A1 - Gamrath, Gerald A1 - Gleixner, Ambros A1 - Gottwald, Leona A1 - Graczyk, Christoph A1 - Halbig, Katrin A1 - Hoen, Alexander A1 - Hojny, Christopher A1 - Hulst, Rolf A1 - Koch, Thorsten A1 - Lübbecke, Marco A1 - Maher, Stephen J. A1 - Matter, Frederic A1 - Mühmer, Erik A1 - Müller, Benjamin A1 - Pfetsch, Marc A1 - Rehfeldt, Daniel A1 - Schlein, Steffan A1 - Schlösser, Franziska A1 - Serrano, Felipe A1 - Shinano, Yuji A1 - Sofranac, Boro A1 - Turner, Mark A1 - Vigerske, Stefan A1 - Wegscheider, Fabian A1 - Wellner, Philipp A1 - Weninger, Dieter A1 - Witzig, Jakob T1 - Enabling research through the SCIP optimization suite 8.0 JF - ACM Transactions on Mathematical Software N2 - The SCIP Optimization Suite provides a collection of software packages for mathematical optimization centered around the constraint integer programming framework SCIP. The focus of this article is on the role of the SCIP Optimization Suite in supporting research. SCIP’s main design principles are discussed, followed by a presentation of the latest performance improvements and developments in version 8.0, which serve both as examples of SCIP’s application as a research tool and as a platform for further developments. Furthermore, this article gives an overview of interfaces to other programming and modeling languages, new features that expand the possibilities for user interaction with the framework, and the latest developments in several extensions built upon SCIP. Y1 - 2023 U6 - https://doi.org/10.1145/3585516 VL - 49 IS - 2 SP - 1 EP - 21 ER - TY - JOUR A1 - Bestuzheva, Ksenia A1 - Chmiela, Antonia A1 - Müller, Benjamin A1 - Serrano, Felipe A1 - Vigerske, Stefan A1 - Wegscheider, Fabian T1 - Global Optimization of Mixed-Integer Nonlinear Programs with SCIP 8.0 JF - Journal of Global Optimization N2 - For over ten years, the constraint integer programming framework SCIP has been extended by capabilities for the solution of convex and nonconvex mixed-integer nonlinear programs (MINLPs). With the recently published version 8.0, these capabilities have been largely reworked and extended. This paper discusses the motivations for recent changes and provides an overview of features that are particular to MINLP solving in SCIP. Further, difficulties in benchmarking global MINLP solvers are discussed and a comparison with several state-of-the-art global MINLP solvers is provided. Y1 - 2023 U6 - https://doi.org/10.1007/s10898-023-01345-1 ER - TY - JOUR A1 - Chmiela, Antonia A1 - Muñoz, Gonzalo A1 - Serrano, Felipe T1 - Monoidal strengthening and unique lifting in MIQCPs JF - Mathematical Programming B Y1 - 2025 U6 - https://doi.org/10.1007/s10107-024-02112-0 VL - 210 SP - 189 EP - 222 ER - TY - JOUR A1 - Chmiela, Antonia A1 - Muñoz, Gonzalo A1 - Serrano, Felipe T1 - On the implementation and strengthening of intersection cuts for QCQPs JF - Mathematical Programming B Y1 - 2023 U6 - https://doi.org/10.1007/s10107-022-01808-5 VL - 197 SP - 549 EP - 586 ER - TY - JOUR A1 - Woodstock, Zev A1 - Pokutta, Sebastian T1 - Splitting the conditional gradient algorithm JF - SIAM Journal on Optimization Y1 - 2025 U6 - https://doi.org/10.1137/24M1638008 VL - 35 IS - 1 SP - 347 EP - 368 ER - TY - JOUR A1 - Halbig, Katrin A1 - Hoen, Alexander A1 - Gleixner, Ambros A1 - Witzig, Jakob A1 - Weninger, Dieter T1 - A diving heuristic for mixed-integer problems with unbounded semi-continuous variables JF - EURO Journal on Computational Optimization Y1 - 2025 U6 - https://doi.org/10.1016/j.ejco.2025.100107 VL - 13 ER -