TY - CHAP A1 - Borndörfer, Ralf A1 - Neumann, Marika A1 - Pfetsch, Marc ED - Haasis, Hans-Dietrich ED - Kopfer, Herbert ED - Schönberger, Jörn T1 - Optimal Fares for Public Transport T2 - Operations Research Proceedings 2005 Y1 - 2006 UR - {http://opus.kobv.de/zib/volltexte/2005/869/} SP - 29 EP - 36 PB - Springer-Verlag ER - TY - JOUR A1 - Borndörfer, Ralf A1 - Grötschel, Martin A1 - Pfetsch, Marc T1 - Public transport to the fORe JF - OR/MS Today Y1 - 2006 UR - http://www.lionhrtpub.com/orms/orms-4-06/frtransport.html SP - 30 EP - 40 ER - TY - CHAP A1 - Pfetsch, Marc A1 - Borndörfer, Ralf ED - Haasis, Hans-Dietrich T1 - Routing in Line Planning for Public Transportation T2 - Operations Research Proceedings 2005 Y1 - 2006 UR - http://opus.kobv.de/zib/volltexte/2005/870/ SP - 405 EP - 410 PB - Springer-Verlag ER - TY - JOUR A1 - Borndörfer, Ralf A1 - Grötschel, Martin A1 - Pfetsch, Marc T1 - A Column-Generation Approach to Line Planning in Public Transport JF - Transportation Science (INFORMS) Y1 - 2007 U6 - https://doi.org/10.1287/trsc.1060.0161 VL - 41 IS - 1 SP - 123 EP - 132 ER - TY - CHAP A1 - Borndörfer, Ralf A1 - Grötschel, Martin A1 - Pfetsch, Marc ED - Hickman, Mark ED - Mirchandani, Pitu ED - Voß, Stefan T1 - Models for Line Planning in Public Transport T2 - Computer-aided Systems in Public Transport (CASPT 2004) Y1 - 2008 U6 - https://doi.org/10.1007/978-3-540-73312-6_18 VL - 600 SP - 363 EP - 378 PB - Springer-Verlag ER - TY - CHAP A1 - Borndörfer, Ralf A1 - Neumann, Marika A1 - Pfetsch, Marc T1 - Angebotsplanung im öffentlichen Nahverkehr T2 - HEUREKA’08 Y1 - 2008 UR - http://opus.kobv.de/zib/volltexte/2008/1084/ PB - FGSV Verlag ER - TY - CHAP A1 - Torres, Luis Miguel A1 - Torres, Ramiro A1 - Borndörfer, Ralf A1 - Pfetsch, Marc ED - Fischetti, Matteo ED - Widmayer, Peter T1 - Line Planning on Paths and Tree Networks with Applications to the Quito Trolebus System T2 - ATMOS 2008 - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems Y1 - 2008 UR - http://drops.dagstuhl.de/opus/volltexte/2008/1580 PB - Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany CY - Dagstuhl, Germany ER - TY - CHAP A1 - Borndörfer, Ralf A1 - Neumann, Marika A1 - Pfetsch, Marc ED - Barnhart, Cynthia ED - Clausen, Uwe ED - Lauther, Ulrich ED - Möhring, Rolf T1 - Line Planning and Connectivity T2 - Models and Algorithms for Optimization in Logistics Y1 - 2009 IS - 09261 PB - Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany CY - Dagstuhl, Germany ER - TY - CHAP A1 - Borndörfer, Ralf A1 - Neumann, Marika A1 - Pfetsch, Marc ED - Fleischmann, Bernhard ED - Borgwardt, Karl ED - Klein, Robert ED - Tuma, Axel T1 - The Line Connectivity Problem T2 - Operations Research Proceedings 2008 Y1 - 2009 UR - http://opus.kobv.de/zib/volltexte/2008/1117/ SP - 557 EP - 562 PB - Springer-Verlag ER - TY - CHAP A1 - Berthold, Timo A1 - Heinz, Stefan A1 - Pfetsch, Marc ED - Kullmann, Oliver T1 - Nonlinear pseudo-Boolean optimization T2 - Theory and Applications of Satisfiability Testing – SAT 2009 Y1 - 2009 VL - 5584 SP - 441 EP - 446 PB - Springer ER - TY - CHAP A1 - Berthold, Timo A1 - Pfetsch, Marc ED - Fleischmann, Bernhard ED - Borgwardt, Karl ED - Klein, Robert ED - Tuma, Axel T1 - Detecting Orbitopal Symmetries T2 - Operations Research Proceedings 2008 Y1 - 2009 SP - 433 EP - 438 PB - Springer-Verlag ER - TY - CHAP A1 - Berthold, Timo A1 - Heinz, Stefan A1 - Pfetsch, Marc A1 - Vigerske, Stefan T1 - Large Neighborhood Search beyond MIP T2 - Proceedings of the 9th Metaheuristics International Conference (MIC 2011) N2 - Large neighborhood search (LNS) heuristics are an important component of modern branch-and-cut algorithms for solving mixed-integer linear programs (MIPs). Most of these LNS heuristics use the LP relaxation as the basis for their search, which is a reasonable choice in case of MIPs. However, for more general problem classes, the LP relaxation alone may not contain enough information about the original problem to find feasible solutions with these heuristics, e.g., if the problem is nonlinear or not all constraints are present in the current relaxation. In this paper, we discuss a generic way to extend LNS heuristics that have been developed for MIP to constraint integer programming (CIP), which is a generalization of MIP in the direction of constraint programming (CP). We present computational results of LNS heuristics for three problem classes: mixed-integer quadratically constrained programs, nonlinear pseudo-Boolean optimization instances, and resource-constrained project scheduling problems. Therefore, we have implemented extended versions of the following LNS heuristics in the constraint integer programming framework SCIP: Local Branching, RINS, RENS, Crossover, and DINS. Our results indicate that a generic generalization of LNS heuristics to CIP considerably improves the success rate of these heuristics. Y1 - 2011 SN - 978-88-900984-3-7 SP - 51 EP - 60 ER - TY - CHAP A1 - Martin, Alexander A1 - Geißler, Björn A1 - Heyn, Christine A1 - Hiller, Benjamin A1 - Humpola, Jesco A1 - Koch, Thorsten A1 - Lehmann, Thomas A1 - Morsi, Antonio A1 - Pfetsch, Marc A1 - Schewe, Lars A1 - Schmidt, Martin A1 - Schultz, Rüdiger A1 - Schwarz, Robert A1 - Schweiger, Jonas A1 - Steinbach, Marc A1 - Willert, Bernhard T1 - Optimierung Technischer Kapazitäten in Gasnetzen T2 - Optimierung in der Energiewirtschaft Y1 - 2011 SP - 105 EP - 114 PB - VDI-Verlag, Düsseldorf ER - TY - JOUR A1 - Borndörfer, Ralf A1 - Karbstein, Marika A1 - Pfetsch, Marc T1 - Models for Fare Planning in Public Transport JF - Discrete Applied Mathematics Y1 - 2012 U6 - https://doi.org/10.1016/j.dam.2012.02.027 VL - 160 IS - 18 SP - 2591 EP - 2605 ER - TY - GEN A1 - Koch, Thorsten A1 - Martin, Alexander A1 - Pfetsch, Marc ED - Jünger, Michael ED - Reinelt, Gerhard T1 - Progress in Academic Computational Integer Programming T2 - Facets of Combinatorial Optimization Y1 - 2013 U6 - https://doi.org/10.1007/978-3-642-38189-8_19 SP - 483 EP - 506 PB - Springer ER - TY - JOUR A1 - Borndörfer, Ralf A1 - Karbstein, Marika A1 - Pfetsch, Marc T1 - The Steiner connectivity problem JF - Mathematical Programming A Y1 - 2013 U6 - https://doi.org/10.1007/s10107-012-0564-5 VL - 142 IS - 1 SP - 133 EP - 167 ER - TY - JOUR A1 - Pfetsch, Marc A1 - Fügenschuh, Armin A1 - Geißler, Björn A1 - Geißler, Nina A1 - Gollmer, Ralf A1 - Hiller, Benjamin A1 - Humpola, Jesco A1 - Koch, Thorsten A1 - Lehmann, Thomas A1 - Martin, Alexander A1 - Morsi, Antonio A1 - Rövekamp, Jessica A1 - Schewe, Lars A1 - Schmidt, Martin A1 - Schultz, Rüdiger A1 - Schwarz, Robert A1 - Schweiger, Jonas A1 - Stangl, Claudia A1 - Steinbach, Marc A1 - Vigerske, Stefan A1 - Willert, Bernhard T1 - Validation of Nominations in Gas Network Optimization: Models, Methods, and Solutions JF - Optimization Methods and Software N2 - In this article we investigate methods to solve a fundamental task in gas transportation, namely the validation of nomination problem: Given a gas transmission network consisting of passive pipelines and active, controllable elements and given an amount of gas at every entry and exit point of the network, find operational settings for all active elements such that there exists a network state meeting all physical, technical, and legal constraints. We describe a two-stage approach to solve the resulting complex and numerically difficult feasibility problem. The first phase consists of four distinct algorithms applying linear, and methods for complementarity constraints to compute possible settings for the discrete decisions. The second phase employs a precise continuous programming model of the gas network. Using this setup, we are able to compute high quality solutions to real-world industrial instances that are significantly larger than networks that have appeared in the mathematical programming literature before. Y1 - 2014 U6 - https://doi.org/10.1080/10556788.2014.888426 PB - Taylor & Francis ER - TY - BOOK A1 - Koch, Thorsten A1 - Hiller, Benjamin A1 - Pfetsch, Marc A1 - Schewe, Lars T1 - Evaluating Gas Network Capacities Y1 - 2015 SN - 978-1-611973-68-6 PB - SIAM ER - TY - CHAP A1 - Koch, Thorsten A1 - Pfetsch, Marc A1 - Rövekamp, Jessica T1 - Introduction T2 - Evaluating Gas Network Capacities Y1 - 2015 SN - 9781611973686 SP - 3 EP - 16 PB - Society for Industrial and Applied Mathematics ER - TY - CHAP A1 - Bargmann, Dagmar A1 - Ebbers, Mirko A1 - Heinecke, Nina A1 - Koch, Thorsten A1 - Kühl, Veronika A1 - Pelzer, Antje A1 - Pfetsch, Marc A1 - Rövekamp, Jessica A1 - Spreckelsen, Klaus T1 - State-of-the-art in evaluating gas network capacities T2 - Evaluating Gas Network Capacities Y1 - 2015 SN - 9781611973686 SP - 65 EP - 84 PB - Society for Industrial and Applied Mathematics ER -