@article{Le BodicPfetschPavelkaetal.2018, author = {Le Bodic, P. and Pfetsch, Marc and Pavelka, J. and Pokutta, Sebastian}, title = {Solving MIPs via Scaling-based Augmentation}, volume = {27}, journal = {Discrete Optimization}, arxiv = {http://arxiv.org/abs/1509.03206}, pages = {1 -- 25}, year = {2018}, 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}, 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} } @article{BorndoerferGroetschelPfetsch2007, author = {Bornd{\"o}rfer, Ralf and Gr{\"o}tschel, Martin and Pfetsch, Marc}, title = {A Column-Generation Approach to Line Planning in Public Transport}, volume = {41}, journal = {Transportation Science (INFORMS)}, number = {1}, doi = {10.1287/trsc.1060.0161}, pages = {123 -- 132}, year = {2007}, language = {en} } @article{BorndoerferKarbsteinPfetsch2012, author = {Bornd{\"o}rfer, Ralf and Karbstein, Marika and Pfetsch, Marc}, title = {Models for Fare Planning in Public Transport}, volume = {160}, journal = {Discrete Applied Mathematics}, number = {18}, doi = {10.1016/j.dam.2012.02.027}, pages = {2591 -- 2605}, year = {2012}, language = {en} } @article{KochSchmidtHilleretal.2020, author = {Koch, Thorsten and Schmidt, Martin and Hiller, Benjamin and Pfetsch, Marc and Geißler, Bj{\"o}rn and Henrion, Ren{\´e} and Joormann, Imke and Martin, Alexander and Morsi, Antonio and R{\"o}misch, Werner and Schewe, Lars and Schultz, R{\"u}diger}, title = {Capacity Evaluation for Large-Scale Gas Networks}, volume = {35}, journal = {German Success Stories in Industrial Mathematics}, isbn = {978-3-030-81454-0}, doi = {10.1007/978-3-030-81455-7}, pages = {23 -- 28}, year = {2020}, language = {en} } @article{HendelAndersonLeBodicetal.2021, author = {Hendel, Gregor and Anderson, Daniel and Le Bodic, Pierre and Pfetsch, Marc}, title = {Estimating the Size of Branch-And-Bound Trees}, journal = {INFORMS Journal on Computing}, doi = {10.1287/ijoc.2021.1103}, year = {2021}, 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{PfetschPokutta2020, author = {Pfetsch, Marc and Pokutta, Sebastian}, title = {IPBoost - Non-Convex Boosting via Integer Programming}, booktitle = {Proceedings of ICML}, arxiv = {http://arxiv.org/abs/2002.04679}, year = {2020}, language = {en} } @inproceedings{ThuerckSofranacPfetschetal.2023, author = {Thuerck, Daniel and Sofranac, Boro and Pfetsch, Marc and Pokutta, Sebastian}, title = {Learning cuts via enumeration oracles}, booktitle = {Proceedings of Conference on Neural Information Processing Systems}, year = {2023}, language = {en} } @inproceedings{BorndoerferNeumannPfetsch2009, author = {Bornd{\"o}rfer, Ralf and Neumann, Marika and Pfetsch, Marc}, title = {Line Planning and Connectivity}, 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} } @incollection{BorndoerferNeumannPfetsch2006, author = {Bornd{\"o}rfer, Ralf and Neumann, Marika and Pfetsch, Marc}, title = {Optimal Fares for Public Transport}, 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} }