@article{BorndoerferKarbsteinPfetsch, author = {Bornd{\"o}rfer, Ralf and Karbstein, Marika and Pfetsch, Marc}, title = {The Steiner connectivity problem}, series = {Mathematical Programming A}, volume = {142}, journal = {Mathematical Programming A}, number = {1}, doi = {10.1007/s10107-012-0564-5}, pages = {133 -- 167}, language = {en} } @article{BorndoerferKarbsteinPfetsch, author = {Bornd{\"o}rfer, Ralf and Karbstein, Marika and Pfetsch, Marc}, title = {Models for Fare Planning in Public Transport}, series = {Discrete Applied Mathematics}, volume = {160}, journal = {Discrete Applied Mathematics}, number = {18}, doi = {10.1016/j.dam.2012.02.027}, pages = {2591 -- 2605}, language = {en} } @article{SchmidtAssmannBurlacuetal., author = {Schmidt, Martin and Assmann, Denis and Burlacu, Robert and Humpola, Jesco and Joormann, Imke and Kanelakis, Nikolaos and Koch, Thorsten and Oucherif, Djamal and Pfetsch, Marc and Schewe, Lars and Schwarz, Robert and Sirvent, Matthias}, title = {GasLib - A Library of Gas Network Instances}, series = {Data}, volume = {2}, journal = {Data}, number = {4}, doi = {10.3390/data2040040}, language = {en} } @inproceedings{MartinGeisslerHeynetal.2011, author = {Martin, Alexander and Geißler, Bj{\"o}rn and Heyn, Christine and Hiller, Benjamin and Humpola, Jesco and Koch, Thorsten and Lehmann, Thomas and Morsi, Antonio and Pfetsch, Marc and Schewe, Lars and Schmidt, Martin and Schultz, R{\"u}diger and Schwarz, Robert and Schweiger, Jonas and Steinbach, Marc and Willert, Bernhard}, title = {Optimierung Technischer Kapazit{\"a}ten in Gasnetzen}, series = {Optimierung in der Energiewirtschaft}, booktitle = {Optimierung in der Energiewirtschaft}, publisher = {VDI-Verlag, D{\"u}sseldorf}, pages = {105 -- 114}, year = {2011}, language = {en} } @incollection{BorndoerferNeumannPfetsch2006, author = {Bornd{\"o}rfer, Ralf and Neumann, Marika and Pfetsch, Marc}, title = {Optimal Fares for Public Transport}, series = {Operations Research Proceedings 2005}, booktitle = {Operations Research Proceedings 2005}, editor = {Haasis, Hans-Dietrich and Kopfer, Herbert and Sch{\"o}nberger, J{\"o}rn}, publisher = {Springer-Verlag}, pages = {29 -- 36}, year = {2006}, language = {en} } @inproceedings{BorndoerferNeumannPfetsch2009, author = {Bornd{\"o}rfer, Ralf and Neumann, Marika and Pfetsch, Marc}, title = {Line Planning and Connectivity}, series = {Models and Algorithms for Optimization in Logistics}, booktitle = {Models and Algorithms for Optimization in Logistics}, number = {09261}, editor = {Barnhart, Cynthia and Clausen, Uwe and Lauther, Ulrich and M{\"o}hring, Rolf}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany}, address = {Dagstuhl, Germany}, year = {2009}, language = {en} } @inproceedings{BorndoerferGroetschelPfetsch2008, author = {Bornd{\"o}rfer, Ralf and Gr{\"o}tschel, Martin and Pfetsch, Marc}, title = {Models for Line Planning in Public Transport}, series = {Computer-aided Systems in Public Transport (CASPT 2004)}, volume = {600}, booktitle = {Computer-aided Systems in Public Transport (CASPT 2004)}, editor = {Hickman, Mark and Mirchandani, Pitu and Voß, Stefan}, publisher = {Springer-Verlag}, doi = {10.1007/978-3-540-73312-6_18}, pages = {363 -- 378}, year = {2008}, language = {en} } @inproceedings{BorndoerferNeumannPfetsch2008, author = {Bornd{\"o}rfer, Ralf and Neumann, Marika and Pfetsch, Marc}, title = {Angebotsplanung im {\"o}ffentlichen Nahverkehr}, series = {HEUREKA'08}, booktitle = {HEUREKA'08}, publisher = {FGSV Verlag}, year = {2008}, language = {en} } @inproceedings{TorresTorresBorndoerferetal.2008, author = {Torres, Luis Miguel and Torres, Ramiro and Bornd{\"o}rfer, Ralf and Pfetsch, Marc}, title = {Line Planning on Paths and Tree Networks with Applications to the Quito Trolebus System}, series = {ATMOS 2008 - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems}, booktitle = {ATMOS 2008 - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems}, editor = {Fischetti, Matteo and Widmayer, Peter}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany}, address = {Dagstuhl, Germany}, year = {2008}, language = {en} } @inproceedings{BorndoerferNeumannPfetsch2009, author = {Bornd{\"o}rfer, Ralf and Neumann, Marika and Pfetsch, Marc}, title = {The Line Connectivity Problem}, series = {Operations Research Proceedings 2008}, booktitle = {Operations Research Proceedings 2008}, editor = {Fleischmann, Bernhard and Borgwardt, Karl and Klein, Robert and Tuma, Axel}, publisher = {Springer-Verlag}, pages = {557 -- 562}, year = {2009}, language = {en} } @article{BorndoerferGroetschelPfetsch2006, author = {Bornd{\"o}rfer, Ralf and Gr{\"o}tschel, Martin and Pfetsch, Marc}, title = {Public transport to the fORe}, series = {OR/MS Today}, journal = {OR/MS Today}, pages = {30 -- 40}, year = {2006}, language = {en} } @inproceedings{PfetschBorndoerfer2006, author = {Pfetsch, Marc and Bornd{\"o}rfer, Ralf}, title = {Routing in Line Planning for Public Transportation}, series = {Operations Research Proceedings 2005}, booktitle = {Operations Research Proceedings 2005}, editor = {Haasis, Hans-Dietrich}, publisher = {Springer-Verlag}, pages = {405 -- 410}, year = {2006}, language = {en} } @inproceedings{BertholdHeinzPfetsch2009, author = {Berthold, Timo and Heinz, Stefan and Pfetsch, Marc}, title = {Nonlinear pseudo-Boolean optimization}, series = {Theory and Applications of Satisfiability Testing - SAT 2009}, volume = {5584}, booktitle = {Theory and Applications of Satisfiability Testing - SAT 2009}, editor = {Kullmann, Oliver}, publisher = {Springer}, pages = {441 -- 446}, year = {2009}, language = {en} } @inproceedings{BertholdPfetsch2009, author = {Berthold, Timo and Pfetsch, Marc}, title = {Detecting Orbitopal Symmetries}, series = {Operations Research Proceedings 2008}, booktitle = {Operations Research Proceedings 2008}, editor = {Fleischmann, Bernhard and Borgwardt, Karl and Klein, Robert and Tuma, Axel}, publisher = {Springer-Verlag}, pages = {433 -- 438}, year = {2009}, language = {en} } @incollection{KochPfetschRoevekamp, author = {Koch, Thorsten and Pfetsch, Marc and R{\"o}vekamp, Jessica}, title = {Introduction}, series = {Evaluating Gas Network Capacities}, booktitle = {Evaluating Gas Network Capacities}, publisher = {Society for Industrial and Applied Mathematics}, isbn = {9781611973686}, pages = {3 -- 16}, language = {en} } @incollection{BargmannEbbersHeineckeetal., author = {Bargmann, Dagmar and Ebbers, Mirko and Heinecke, Nina and Koch, Thorsten and K{\"u}hl, Veronika and Pelzer, Antje and Pfetsch, Marc and R{\"o}vekamp, Jessica and Spreckelsen, Klaus}, title = {State-of-the-art in evaluating gas network capacities}, series = {Evaluating Gas Network Capacities}, booktitle = {Evaluating Gas Network Capacities}, publisher = {Society for Industrial and Applied Mathematics}, isbn = {9781611973686}, pages = {65 -- 84}, language = {en} } @incollection{ScheweKochMartinetal., author = {Schewe, Lars and Koch, Thorsten and Martin, Alexander and Pfetsch, Marc}, title = {Mathematical optimization for evaluating gas network capacities}, series = {Evaluating Gas Network Capacities}, booktitle = {Evaluating Gas Network Capacities}, publisher = {Society for Industrial and Applied Mathematics}, isbn = {9781611973686}, pages = {87 -- 102}, language = {en} } @incollection{HillerHumpolaLehmannetal., author = {Hiller, Benjamin and Humpola, Jesco and Lehmann, Thomas and Lenz, Ralf and Morsi, Antonio and Pfetsch, Marc and Schewe, Lars and Schmidt, Martin and Schwarz, Robert and Schweiger, Jonas and Stangl, Claudia and Willert, Bernhard}, title = {Computational results for validation of nominations}, series = {Evaluating Gas Network Capacities}, volume = {SIAM-MOS series on Optimization}, booktitle = {Evaluating Gas Network Capacities}, isbn = {9781611973686}, abstract = {The different approaches to solve the validation of nomination problem presented in the previous chapters are evaluated computationally in this chapter. Each approach is analyzed individually, as well as the complete solvers for these problems. We demonstrate that the presented approaches can successfully solve large-scale real-world instances.}, language = {en} } @misc{HendelAndersonLeBodicetal., author = {Hendel, Gregor and Anderson, Daniel and Le Bodic, Pierre and Pfetsch, Marc}, title = {Estimating the Size of Branch-And-Bound Trees}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-78144}, abstract = {This paper investigates the estimation of the size of Branch-and-Bound (B\&B) trees for solving mixed-integer programs. We first prove that the size of the B\&B tree cannot be approximated within a factor of~2 for general binary programs, unless P equals NP. Second, we review measures of the progress of the B\&B search, such as the gap, and propose a new measure, which we call leaf frequency. We study two simple ways to transform these progress measures into B\&B tree size estimates, either as a direct projection, or via double-exponential smoothing, a standard time-series forecasting technique. We then combine different progress measures and their trends into nontrivial estimates using Machine Learning techniques, which yields more precise estimates than any individual measure. The best method we have identified uses all individual measures as features of a random forest model. In a large computational study, we train and validate all methods on the publicly available MIPLIB and Coral general purpose benchmark sets. On average, the best method estimates B\&B tree sizes within a factor of 3 on the set of unseen test instances even during the early stage of the search, and improves in accuracy as the search progresses. It also achieves a factor 2 over the entire search on each out of six additional sets of homogeneous instances we have tested. All techniques are available in version 7 of the branch-and-cut framework SCIP.}, language = {en} } @inproceedings{PfetschPokutta, author = {Pfetsch, Marc and Pokutta, Sebastian}, title = {IPBoost - Non-Convex Boosting via Integer Programming}, series = {Proceedings of ICML}, booktitle = {Proceedings of ICML}, language = {en} }