@article{ConradGenzelCvetkovicetal.2017, author = {Conrad, Tim and Genzel, Martin and Cvetkovic, Nada and Wulkow, Niklas and Leichtle, Alexander Benedikt and Vybiral, Jan and Kytyniok, Gitta and Sch{\"u}tte, Christof}, title = {Sparse Proteomics Analysis - a compressed sensing-based approach for feature selection and classification of high-dimensional proteomics mass spectrometry data}, volume = {18}, journal = {BMC Bioinfomatics}, number = {160}, doi = {10.1186/s12859-017-1565-4}, year = {2017}, abstract = {Background: High-throughput proteomics techniques, such as mass spectrometry (MS)-based approaches, produce very high-dimensional data-sets. In a clinical setting one is often interested in how mass spectra differ between patients of different classes, for example spectra from healthy patients vs. spectra from patients having a particular disease. Machine learning algorithms are needed to (a) identify these discriminating features and (b) classify unknown spectra based on this feature set. Since the acquired data is usually noisy, the algorithms should be robust against noise and outliers, while the identified feature set should be as small as possible. Results: We present a new algorithm, Sparse Proteomics Analysis (SPA),based on thet heory of compressed sensing that allows us to identify a minimal discriminating set of features from mass spectrometry data-sets. We show (1) how our method performs on artificial and real-world data-sets, (2) that its performance is competitive with standard (and widely used) algorithms for analyzing proteomics data, and (3) that it is robust against random and systematic noise. We further demonstrate the applicability of our algorithm to two previously published clinical data-sets.}, language = {en} } @article{WilsonAnglinAmbellanetal.2017, author = {Wilson, David and Anglin, Carolyn and Ambellan, Felix and Grewe, Carl Martin and Tack, Alexander and Lamecker, Hans and Dunbar, Michael and Zachow, Stefan}, title = {Validation of three-dimensional models of the distal femur created from surgical navigation point cloud data for intraoperative and postoperative analysis of total knee arthroplasty}, volume = {12}, journal = {International Journal of Computer Assisted Radiology and Surgery}, number = {12}, publisher = {Springer}, doi = {10.1007/s11548-017-1630-5}, pages = {2097 -- 2105}, year = {2017}, abstract = {Purpose: Despite the success of total knee arthroplasty there continues to be a significant proportion of patients who are dissatisfied. One explanation may be a shape mismatch between pre and post-operative distal femurs. The purpose of this study was to investigate a method to match a statistical shape model (SSM) to intra-operatively acquired point cloud data from a surgical navigation system, and to validate it against the pre-operative magnetic resonance imaging (MRI) data from the same patients. Methods: A total of 10 patients who underwent navigated total knee arthroplasty also had an MRI scan less than 2 months pre-operatively. The standard surgical protocol was followed which included partial digitization of the distal femur. Two different methods were employed to fit the SSM to the digitized point cloud data, based on (1) Iterative Closest Points (ICP) and (2) Gaussian Mixture Models (GMM). The available MRI data were manually segmented and the reconstructed three-dimensional surfaces used as ground truth against which the statistical shape model fit was compared. Results: For both approaches, the difference between the statistical shape model-generated femur and the surface generated from MRI segmentation averaged less than 1.7 mm, with maximum errors occurring in less clinically important areas. Conclusion: The results demonstrated good correspondence with the distal femoral morphology even in cases of sparse data sets. Application of this technique will allow for measurement of mismatch between pre and post-operative femurs retrospectively on any case done using the surgical navigation system and could be integrated into the surgical navigation unit to provide real-time feedback.}, language = {en} } @inproceedings{WeinholdLackorzynskiBierbaumetal.2016, author = {Weinhold, Carsten and Lackorzynski, Adam and Bierbaum, Jan and K{\"u}ttler, Martin and Planeta, Maksym and H{\"a}rtig, Hermann and Shiloh, Amnon and Levy, Ely and Ben-Nun, Tal and Barak, Amnon and Steinke, Thomas and Sch{\"u}tt, Thorsten and Fajerski, Jan and Reinefeld, Alexander and Lieber, Matthias and Nagel, Wolfgang}, title = {FFMK: A Fast and Fault-tolerant Microkernel-based System for Exascale Computing}, booktitle = {SPPEXA Symposium 2016}, doi = {10.1007/978-3-319-40528-5_18}, year = {2016}, language = {en} } @article{HeidaSikorskiWeber2022, author = {Heida, Martin and Sikorski, Alexander and Weber, Marcus}, title = {Consistency and order 1 convergence of cell-centered finite volume discretizations of degenerate elliptic problems in any space dimension}, journal = {SIAM Journal on Numerical Analysis}, doi = {10.20347/WIAS.PREPRINT.2913}, year = {2022}, abstract = {We study consistency of cell-centered finite difference methods for elliptic equations with degenerate coefficients in any space dimension \$d \geq 2\$. This results in order of convergence estimates in the natural weighted energy norm and in the weighted discrete \$L^2\$-norm on admissible meshes. The cells of meshes under consideration may be very irregular in size. We particularly allow the size of certain cells to remain bounded from below even in the asymptotic limit. For uniform meshes we show that the order of convergence is at least 1 in the energy semi-norm, provided the discrete and continuous solutions exist and the continuous solution has \$H^2\$ regularity.}, language = {en} } @article{SikorskiHeida2024, author = {Sikorski, Alexander and Heida, Martin}, title = {Voronoi Graph - Improved raycasting and integration schemes for high dimensional Voronoi diagrams}, arxiv = {http://arxiv.org/abs/2405.10050}, year = {2024}, abstract = {The computation of Voronoi Diagrams, or their dual Delauney triangulations is difficult in high dimensions. In a recent publication Polianskii and Pokorny propose an iterative randomized algorithm facilitating the approximation of Voronoi tesselations in high dimensions. In this paper, we provide an improved vertex search method that is not only exact but even faster than the bisection method that was previously recommended. Building on this we also provide a depth-first graph-traversal algorithm which allows us to compute the entire Voronoi diagram. This enables us to compare the outcomes with those of classical algorithms like qHull, which we either match or marginally beat in terms of computation time. We furthermore show how the raycasting algorithm naturally lends to a Monte Carlo approximation for the volume and boundary integrals of the Voronoi cells, both of which are of importance for finite Volume methods. We compare the Monte-Carlo methods to the exact polygonal integration, as well as a hybrid approximation scheme.}, language = {en} } @article{XieGruberCrampenetal.2025, author = {Xie, Kunpeng and Gruber, Lennart Johannes and Crampen, Martin and Li, Yao and Ferreira, Andr{\´e} and Tappeiner, Elias and Gillot, Maxime and Schepers, Jan and Xu, Jiangchang and Pankert, Tobias and Beyer, Michel and Shahamiri, Negar and ten Brink, Reinier and Dot, Gauthier and Weschke, Charlotte and van Nistelrooij, Niels and Verhelst, Pieter-Jan and Guo, Yan and Xu, Zhibin and Bienzeisler, Jonas and Rashad, Ashkan and Fl{\"u}gge, Tabea and Cotton, Ross and Vinayahalingam, Shankeeth and Ilesan, Robert and Raith, Stefan and Madsen, Dennis and Seibold, Constantin and Xi, Tong and Berg{\´e}, Stefaan and Nebelung, Sven and Kodym, Oldřich and Sundqvist, Osku and Thieringer, Florian and Lamecker, Hans and Coppens, Antoine and Potrusil, Thomas and Kraeima, Joep and Witjes, Max and Wu, Guomin and Chen, Xiaojun and Lambrechts, Adriaan and Cevidanes, Lucia H Soares and Zachow, Stefan and Hermans, Alexander and Truhn, Daniel and Alves, Victor and Egger, Jan and R{\"o}hrig, Rainer and H{\"o}lzle, Frank and Puladi, Behrus}, title = {Beyond Benchmarks: Towards Robust Artificial Intelligence Bone Segmentation in Socio-Technical Systems}, volume = {299}, journal = {Expert Systems With Applications}, number = {Part D}, doi = {10.1016/j.eswa.2025.130031}, year = {2025}, abstract = {Despite the advances in automated medical image segmentation, AI models still underperform in various clinical settings, challenging real-world integration. In this multicenter evaluation, we analyzed 20 state-of-the-art mandibular segmentation models across 19,218 segmentations of 1,000 clinically resampled CT/CBCT scans. We show that segmentation accuracy varies by up to 25\% depending on socio-technical factors such as voxel size, bone orientation, and patient conditions such as osteosynthesis or pathology. Higher sharpness, isotropic smaller voxels, and neutral orientation significantly improved results, while metallic osteosynthesis and anatomical complexity led to significant degradation. Our findings challenge the common view of AI models as "plug-and-play" tools and suggest evidence-based optimization recommendations for both clinicians and developers. This will in turn boost the integration of AI segmentation tools in routine healthcare.}, language = {en} } @article{BaermannMartinPokuttaetal.2018, author = {B{\"a}rmann, Andreas and Martin, Alexander and Pokutta, Sebastian and Schneider, Oskar}, title = {An Online-Learning Approach to Inverse Optimization}, year = {2018}, language = {en} } @article{EisenblaetterGeerdesKochetal.2005, author = {Eisenbl{\"a}tter, Andreas and Geerdes, Hans-Florian and Koch, Thorsten and Martin, Alexander and Wess{\"a}ly, Roland}, title = {UMTS Radio Network Evaluation and Optimization beyond Snapshots}, volume = {63}, journal = {Mathematical Methods of Operations Research}, number = {1}, doi = {10.1007/s00186-005-0002-z}, pages = {1 -- 29}, year = {2005}, language = {en} } @inproceedings{FuegenschuhHessMartinetal.2007, author = {F{\"u}genschuh, Armin and Hess, Wolfgang and Martin, Alexander and Ulbrich, Stefan}, title = {Diskrete und kontinuierliche Modelle zur Topologie- und Geometrie-Optimierung von Blechprofilen}, booktitle = {Sonderforschungsbereich 666}, editor = {Groche, P.}, pages = {37 -- 47}, year = {2007}, language = {en} } @book{GroetschelLovaszSchrijver1993, author = {Gr{\"o}tschel, Martin and Lov{\´a}sz, L{\´a}szlo and Schrijver, Alexander}, title = {Geometric Algorithms and Combinatorial Optimization}, volume = {2}, journal = {Algorithms and Combinatorics}, edition = {Second corrected edition}, publisher = {Springer}, isbn = {3-540-56740-2, 0-387-56740-2 (U.S.)}, year = {1993}, language = {en} } @incollection{EisenblaetterFuegenschuhKochetal.2002, author = {Eisenbl{\"a}tter, Andreas and F{\"u}genschuh, Armin and Koch, Thorsten and Koster, Arie M.C.A. and Martin, Alexander and Pfender, Tobias and Wegel, Oliver and Wess{\"a}ly, Roland}, title = {Mathematical Model of Feasible Network Configurations for UMTS}, booktitle = {Telecommunications network design and management}, editor = {G. Anandalingam, S.}, publisher = {Kluwer}, pages = {1 -- 24}, year = {2002}, language = {en} } @inproceedings{FuegenschuhMartinStoeveken2004, author = {F{\"u}genschuh, Armin and Martin, Alexander and St{\"o}veken, Peter}, title = {Integrated Optimization of School Starting Times and Public Bus Services}, booktitle = {Mathematics in the Supply Chain}, editor = {Bixby, Robert E. and Simchi-Levi, D. and Martin, Alexander and Zimmermann, U.}, year = {2004}, language = {en} } @inproceedings{EisenblaetterFuegenschuhGeerdesetal.2004, author = {Eisenbl{\"a}tter, Andreas and F{\"u}genschuh, Armin and Geerdes, Hans-Florian and Junglas, Daniel and Koch, Thorsten and Martin, Alexander}, title = {Integer Programming Methods for UMTS Radio Network Planning}, booktitle = {Proceedings of the WiOpt'04, Cambridge, UK}, year = {2004}, language = {en} } @incollection{FuegenschuhMartin2005, author = {F{\"u}genschuh, Armin and Martin, Alexander}, title = {Computational Integer Programming and Cutting Planes}, booktitle = {Handbooks in Operations Research and Management Science, Vol. 12}, editor = {Aardal, Karen I. and Nemhauser, George and Weismantel, R.}, publisher = {North-Holland}, pages = {69 -- 122}, year = {2005}, language = {en} } @inproceedings{FuegenschuhHomfeldHucketal.2006, author = {F{\"u}genschuh, Armin and Homfeld, Henning and Huck, Andreas and Martin, Alexander}, title = {Locomotive and Wagon Scheduling in Freight Transport}, booktitle = {Proceedings of the ATMOS06}, editor = {Jacob, R. and M{\"u}ller-Hannemann, Matthias}, year = {2006}, language = {en} } @inproceedings{FuegenschuhMartinMehlertetal.2005, author = {F{\"u}genschuh, Armin and Martin, Alexander and Mehlert, Christian and St{\"o}veken, Peter}, title = {Ein Planungstool zur Schulzeitstaffelung}, booktitle = {Supply Chain Management und Logistik}, editor = {G{\"u}nther, H.-O. and Mattfeld, D. and Suhl, L.}, pages = {419 -- 436}, year = {2005}, language = {en} } @inproceedings{FuegenschuhMartinStoeveken2005, author = {F{\"u}genschuh, Armin and Martin, Alexander and St{\"o}veken, Peter}, title = {Integrated Optimization of School Starting Times and Public Bus Services}, booktitle = {Operations Research Proceedings}, editor = {Fleuren, Hein and den Hertog, Dick and Kort, Peter}, pages = {150 -- 157}, year = {2005}, language = {en} } @inproceedings{FuegenschuhMartin2007, author = {F{\"u}genschuh, Armin and Martin, Alexander}, title = {Mixed-integer models for topology optimization in sheet metal design}, booktitle = {Sixth International Congress on Industrial Applied Mathematics (ICIAM07) and GAMM Annual Meeting, Z{\"u}rich 2007}, pages = {2060049 -- 2060050}, year = {2007}, language = {en} } @inproceedings{FuegenschuhlerMartinetal.2009, author = {F{\"u}genschuh, Armin and ler, Bj{\"o}rn and Martin, Alexander and Morsi, Antonio}, title = {The Transport PDE and Mixed-Integer Linear Programming}, booktitle = {Dagstuhl Seminar Proceedings 09261, Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik, Deutschland}, editor = {Barnhart, Cynthia and Clausen, Uwe and Lauther, Ulrich and M{\"o}hring, Rolf}, year = {2009}, language = {en} } @inproceedings{FuegenschuhHessScheweetal.2008, author = {F{\"u}genschuh, Armin and Hess, Wolfgang and Schewe, Lars and Martin, Alexander and Ulbrich, Stefan}, title = {Verfeinerte Modelle zur Topologie- und Geometrie-Optimierung von Blechprofilen mit Kammern}, booktitle = {Sonderforschungsbereich 666}, editor = {Groche, P.}, pages = {17 -- 28}, year = {2008}, language = {en} } @incollection{BorndoerferHoangKarbsteinetal.2013, author = {Bornd{\"o}rfer, Ralf and Hoang, Nam-Dung and Karbstein, Marika and Koch, Thorsten and Martin, Alexander}, title = {How many Steiner terminals can you connect in 20 years?}, booktitle = {Facets of Combinatorial Optimization; Festschrift for Martin Gr{\"o}tschel}, editor = {J{\"u}nger, Michael and Reinelt, Gerhard}, publisher = {Springer}, doi = {10.1007/978-3-642-38189-8_10}, pages = {215 -- 244}, year = {2013}, language = {en} } @article{BorndoerferFerreiraMartin1998, author = {Bornd{\"o}rfer, Ralf and Ferreira, Carlos and Martin, Alexander}, title = {Decomposing Matrices into Blocks}, volume = {9}, journal = {SIAM J. Optim.}, number = {1}, pages = {236 -- 269}, year = {1998}, language = {en} } @misc{BorndoerferHoangKarbsteinetal.2013, author = {Bornd{\"o}rfer, Ralf and Hoang, Nam-Dung and Karbstein, Marika and Koch, Thorsten and Martin, Alexander}, title = {How Many Steiner Terminals Can You Connect in 20 Years?}, issn = {1438-0064}, doi = {10.1007/978-3-642-38189-8_10}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-42524}, year = {2013}, abstract = {Steiner trees are constructed to connect a set of terminal nodes in a graph. This basic version of the Steiner tree problem is idealized, but it can effectively guide the search for successful approaches to many relevant variants, from both a theoretical and a computational point of view. This article illustrates the theoretical and algorithmic progress on Steiner tree type problems on two examples, the Steiner connectivity and the Steiner tree packing problem.}, language = {en} } @article{DuerFuegenschuhMartinetal.2010, author = {D{\"u}r, Mirjam and F{\"u}genschuh, Armin and Martin, Alexander and Schabel, Samuel and Sch{\"o}nberger, Christine and Villforth, Klaus}, title = {Steuerung einer Sortieranlage, z.B. f{\"u}r Altpapier}, volume = {EP 09 718 564.9}, journal = {Europ{\"a}ische Patentanmeldung}, year = {2010}, language = {en} } @article{FuegenschuhHertyKlaretal.2006, author = {F{\"u}genschuh, Armin and Herty, Michael and Klar, Axel and Martin, Alexander}, title = {Combinatorial and Continuous Models and Optimization for Traffic Flow on Networks}, volume = {16}, journal = {SIAM Journal on Optimization}, number = {4}, pages = {1155 -- 1176}, year = {2006}, language = {en} } @article{FuegenschuhMartin2006, author = {F{\"u}genschuh, Armin and Martin, Alexander}, title = {Welche Gemeinsamkeiten haben Jugendliche und Groß banken?}, volume = {129}, journal = {mathematiklehren}, pages = {50 -- 54}, year = {2006}, language = {en} } @article{DuerFuegenschuhMartinetal.2008, author = {D{\"u}r, Mirjam and F{\"u}genschuh, Armin and Martin, Alexander and Schabel, Samuel and Sch{\"o}nberger, Christine and Villforth, Klaus}, title = {Verfahren zum Einstellen und/oder Optimieren einer einen Gutstoff von einem Schlechtstoff trennenden Sortieranlage und Sortieranlage}, volume = {DE 10 2008 013 034}, journal = {Deutsches Patent}, year = {2008}, language = {en} } @article{FuegenschuhMartin2004, author = {F{\"u}genschuh, Armin and Martin, Alexander}, title = {Verfahren und Vorrichtung zur automatischen Optimierung von Schulanfangszeiten und des {\"o}ffentlichen Personenverkehrs und entsprechendes Computerprogramm}, volume = {DE 10 2004 020 786.0}, journal = {Deutsche Patentanmeldung}, year = {2004}, language = {en} } @article{DuerFuegenschuhMartinetal.2006, author = {D{\"u}r, Mirjam and F{\"u}genschuh, Armin and Martin, Alexander and Ulbrich, Stefan}, title = {Verfahren und Vorrichtung zum Auswuchten von wellenelastischen Rotoren}, volume = {DE 10 2006 060 583.7}, journal = {Deutsche Patentanmeldung}, year = {2006}, language = {en} } @article{FuegenschuhGoettlichKirchneretal.2009, author = {F{\"u}genschuh, Armin and G{\"o}ttlich, Simone and Kirchner, Claus and Herty, Michael and Martin, Alexander}, title = {Efficient Reformulation and Solution of a Nonlinear PDE-Controlled Flow Network Model}, volume = {85}, journal = {Computing}, number = {3}, pages = {245 -- 265}, year = {2009}, language = {en} } @article{FuegenschuhHomfeldHucketal.2008, author = {F{\"u}genschuh, Armin and Homfeld, Henning and Huck, Andreas and Martin, Alexander and Yuan, Zhi}, title = {Scheduling Locomotives and Car Transfers in Freight Transport}, volume = {42}, journal = {Transportation Science}, number = {4}, pages = {1 -- 14}, year = {2008}, language = {en} } @article{FuegenschuhMartin2006, author = {F{\"u}genschuh, Armin and Martin, Alexander}, title = {A Multicriterial Approach for Optimizing Bus Schedules and School Starting Times}, volume = {147}, journal = {Annals of Operations Research}, number = {1}, pages = {199 -- 216}, year = {2006}, language = {en} } @article{EisenblaetterFuegenschuhFledderusetal.2003, author = {Eisenbl{\"a}tter, Andreas and F{\"u}genschuh, Armin and Fledderus, E. and Geerdes, Hans-Florian and Heideck, B. and Junglas, Daniel and Koch, Thorsten and K{\"u}rner, T. and Martin, Alexander}, title = {Mathematical Methods for Automatic Optimization of UMTS Radio Networks}, number = {D4.3}, editor = {Martin, Alexander}, publisher = {IST-2000-28088 MOMENTUM}, year = {2003}, language = {en} } @article{EisenblaetterGeerdesJunglasetal.2003, author = {Eisenbl{\"a}tter, Andreas and Geerdes, Hans-Florian and Junglas, Daniel and Koch, Thorsten and K{\"u}rner, T. and Martin, Alexander}, title = {Final Report on Automatic Planning and Optimisation}, number = {D4.7}, publisher = {IST-2000-28088 MOMENTUM}, year = {2003}, language = {en} } @misc{DittelFuegenschuhMartin2011, author = {Dittel, Agnes and F{\"u}genschuh, Armin and Martin, Alexander}, title = {Polyhedral Aspects of Self-Avoiding Walks}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-12576}, number = {11-11}, year = {2011}, abstract = {In this paper, we study self-avoiding walks of a given length on a graph. We consider a formulation of this problem as a binary linear program. We analyze the polyhedral structure of the underlying polytope and describe valid inequalities. Proofs for their facial properties for certain special cases are given. In a variation of this problem one is interested in optimal configurations, where an energy function measures the benefit if certain path elements are placed on adjacent vertices of the graph. The most prominent application of this problem is the protein folding problem in biochemistry. On a set of selected instances, we demonstrate the computational merits of our approach.}, language = {en} } @phdthesis{Martin1999, author = {Martin, Alexander}, title = {Integer Programs with Block Structure}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-3911}, number = {SC-99-03}, year = {1999}, abstract = {In this thesis we study and solve integer programs with block structure, i.\,e., problems that after the removal of certain rows (or columns) of the constraint matrix decompose into independent subproblems. The matrices associated with each subproblem are called blocks and the rows (columns) to be removed linking constraints (columns). Integer programs with block structure come up in a natural way in many real-world applications. The methods that are widely used to tackle integer programs with block structure are decomposition methods. The idea is to decouple the linking constraints (variables) from the problem and treat them at a superordinate level, often called master problem. The resulting residual subordinate problem then decomposes into independent subproblems that often can be solved more efficiently. Decomposition methods now work alternately on the master and subordinate problem and iteratively exchange information to solve the original problem to optimality. In Part I we follow a different approach. We treat the integer programming problem as a whole and keep the linking constraints in the formulation. We consider the associated polyhedra and investigate the polyhedral consequences of the involved linking constraints. The variety and complexity of the new inequalities that come into play is illustrated on three different types of real-world problems. The applications arise in the design of electronic circuits, in telecommunication and production planning. We develop a branch-and-cut algorithm for each of these problems, and our computational results show the benefits and limits of the polyhedral approach to solve these real-world models with block structure. Part II of the thesis deals with general mixed integer programming problems, that is integer programs with no apparent structure in the constraint matrix. We will discuss in Chapter 5 the main ingredients of an LP based branch-and-bound algorithm for the solution of general integer programs. Chapter 6 then asks the question whether general integer programs decompose into certain block structures and investigate whether it is possible to recognize such a structure. The remaining two chapters exploit information about the block structure of an integer program. In Chapter 7 we parallelize parts of the dual simplex algorithm, the method that is commonly used for the solution of the underlying linear programs within a branch-and-cut algorithm. In Chapter 8 we try to detect small blocks in the constraint matrix and to derive new cutting planes that strengthen the integer programming formulation. These inequalities may be associated with the intersection of several knapsack problems. We will see that they significantly improve the quality of the general integer programming solver introduced in Chapter 5.}, language = {en} } @misc{GamrathGleixnerKochetal.2016, author = {Gamrath, Gerald and Gleixner, Ambros and Koch, Thorsten and Miltenberger, Matthias and Kniasew, Dimitri and Schl{\"o}gel, Dominik and Martin, Alexander and Weninger, Dieter}, title = {Tackling Industrial-Scale Supply Chain Problems by Mixed-Integer Programming}, issn = {1438-0064}, doi = {10.4208/jcm.1905-m2019-0055}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-61107}, year = {2016}, abstract = {SAP's decision support systems for optimized supply network planning rely on mixed-integer programming as the core engine to compute optimal or near-optimal solutions. The modeling flexibility and the optimality guarantees provided by mixed-integer programming greatly aid the design of a robust and future-proof decision support system for a large and diverse customer base. In this paper we describe our coordinated efforts to ensure that the performance of the underlying solution algorithms matches the complexity of the large supply chain problems and tight time limits encountered in practice.}, language = {en} } @incollection{ScheweKochMartinetal.2015, author = {Schewe, Lars and Koch, Thorsten and Martin, Alexander and Pfetsch, Marc}, title = {Mathematical optimization for evaluating gas network capacities}, booktitle = {Evaluating Gas Network Capacities}, publisher = {Society for Industrial and Applied Mathematics}, isbn = {9781611973686}, pages = {87 -- 102}, year = {2015}, language = {en} } @inproceedings{FuegenschuhHomfeldMartin2007, author = {F{\"u}genschuh, Armin and Homfeld, Henning and Martin, Alexander}, title = {Leitwegeplanung}, booktitle = {Mathematik f{\"u}r Innovationen in Industrie und Dienstleistungen}, year = {2007}, language = {en} } @misc{KochMartinPfetsch2013, author = {Koch, Thorsten and Martin, Alexander and Pfetsch, Marc}, title = {Progress in Academic Computational Integer Programming}, journal = {Facets of Combinatorial Optimization}, editor = {J{\"u}nger, Michael and Reinelt, Gerhard}, publisher = {Springer}, doi = {10.1007/978-3-642-38189-8_19}, pages = {483 -- 506}, year = {2013}, language = {en} } @article{GamrathKochMartinetal.2015, author = {Gamrath, Gerald and Koch, Thorsten and Martin, Alexander and Miltenberger, Matthias and Weninger, Dieter}, title = {Progress in presolving for mixed integer programming}, volume = {7}, journal = {Mathematical Programming Computation}, number = {4}, doi = {10.1007/s12532-015-0083-5}, pages = {367 -- 398}, year = {2015}, abstract = {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.}, language = {en} } @misc{BorndoerferFerreiraMartin1997, author = {Bornd{\"o}rfer, Ralf and Ferreira, Carlos E. and Martin, Alexander}, title = {Decomposing Matrices into Blocks}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-2849}, number = {SC-97-15}, year = {1997}, abstract = {In this paper we investigate whether matrices arising from linear or integer programming problems can be decomposed into so-called {\em bordered block diagonal form}. More precisely, given some matrix \$A\$, we try to assign as many rows as possible to some number of blocks of limited size such that no two rows assigned to different blocks intersect in a common column. Bordered block diagonal form is desirable because it can guide and speed up the solution process for linear and integer programming problems. We show that various matrices from the LP- and MIP-libraries NETLIB and MITLIB can indeed be decomposed into this form by computing optimal decompositions or decompositions with proven quality. These computations are done with a branch-and-cut algorithm based on polyhedral investigations of the matrix decomposition problem. In practice, however, one would use heuristics to find a good decomposition. We present several heuristic ideas and test their performance. Finally, we investigate the usefulness of optimal matrix decompositions into bordered block diagonal form for integer programming by using such decompositions to guide the branching process in a branch-and-cut code for general mixed integer programs.}, language = {en} }