Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem. - Edoardo Amaldi; Marc E. Pfetsch; Leslie E. Trotter Jr. (IPCO, 1999)

Computing the face lattice of a polytope from its vertex-facet incidences. - Volker Kaibel; Marc E. Pfetsch (Comput. Geom., 2002)

Some Algorithmic Problems in Polytope Theory. - Volker Kaibel; Marc E. Pfetsch (Algebra, Geometry, and Software Systems, 2003)

On the maximum feasible subsystem problem, IISs and IIS-hypergraphs. - Edoardo Amaldi; Marc E. Pfetsch; Leslie E. Trotter Jr. (Math. Program., 2003)

Computing Optimal Discrete Morse Functions. - Michael Joswig; Marc E. Pfetsch (Electron. Notes Discret. Math., 2004)

Optimal Fares for Public Transport. - Ralf Borndörfer; Marika Neumann; Marc E. Pfetsch (OR, 2005)

Routing in Line Planning for Public Transport. - Marc E. Pfetsch; Ralf Borndörfer (OR, 2005)

Computing Optimal Morse Matchings. - Michael Joswig; Marc E. Pfetsch (SIAM J. Discret. Math., 2006)

A Column-Generation Approach to Line Planning in Public Transport. - Ralf Borndörfer; Martin Grötschel; Marc E. Pfetsch (Transp. Sci., 2007)

Line Planning on Paths and Tree Networks with Applications to the Quito Trolebús System. - Luis Miguel Torres; Ramiro Torres; Ralf Borndörfer; Marc E. Pfetsch (ATMOS, 2008)

Branch-and-Cut for the Maximum Feasible Subsystem Problem. - Marc E. Pfetsch (SIAM J. Optim., 2008)

Exact and Approximate Sparse Solutions of Underdetermined Linear Equations. - Sadegh Jokar; Marc E. Pfetsch (SIAM J. Sci. Comput., 2008)

Line Planning and Connectivity. - Ralf Borndörfer; Marika Neumann; Marc E. Pfetsch (Models and Algorithms for Optimization in Logistics, 2009)

Nonlinear Pseudo-Boolean Optimization: Relaxation or Propagation?. - Timo Berthold; Stefan Heinz 001; Marc E. Pfetsch (SAT, 2009)

Competitive Online Multicommodity Routing. - Tobias Harks; Stefan Heinz 001; Marc E. Pfetsch (Theory Comput. Syst., 2009)

Branch-Cut-and-Propagate for the Maximum k-Colorable Subgraph Problem with Symmetry. - Tim Januschowski; Marc E. Pfetsch (CPAIOR, 2011)

Disruption Management with Rescheduling of Trips and Vehicle Circulations - Sándor P. Fekete; Alexander Kroeller; Martin Lorek; Marc E. Pfetsch (CoRR, 2011)

The maximum k-colorable subgraph problem and orbitopes. - Tim Januschowski; Marc E. Pfetsch (Discret. Optim., 2011)

Orbitopal fixing. - Volker Kaibel; Matthias Peinhardt; Marc E. Pfetsch (Discret. Optim., 2011)

Line planning on tree networks with applications to the Quito Trolebús system. - Luis Miguel Torres; Ramiro Torres; Ralf Borndörfer; Marc E. Pfetsch (Int. Trans. Oper. Res., 2011)

The Computational Complexity of RIP, NSP, and Related Concepts in Compressed Sensing - Andreas M. Tillmann; Marc E. Pfetsch (CoRR, 2012)

Models for fare planning in public transport. - Ralf Borndörfer; Marika Karbstein; Marc E. Pfetsch (Discret. Appl. Math., 2012)

Computing the bounded subcomplex of an unbounded polyhedron. - Sven Herrmann; Michael Joswig; Marc E. Pfetsch (Comput. Geom., 2013)

Projection Onto The k-Cosparse Set is NP-Hard - Andreas M. Tillmann; Rémi Gribonval; Marc E. Pfetsch (CoRR, 2013)

A heuristic and an exact method for the gate matrix connection cost minimization problem. - Luigi De Giovanni; G. Massi; Ferdinando Pezzella; Marc E. Pfetsch; Giovanni Rinaldi; Paolo Ventura (Int. Trans. Oper. Res., 2013)

The Steiner connectivity problem. - Ralf Borndörfer; Marika Karbstein; Marc E. Pfetsch (Math. Program., 2013)

Projection onto the cosparse set is NP-hard. - Andreas M. Tillmann; Rémi Gribonval; Marc E. Pfetsch (ICASSP, 2014)

An infeasible-point subgradient method using adaptive approximate projections. - Dirk A. Lorenz; Marc E. Pfetsch; Andreas M. Tillmann (Comput. Optim. Appl., 2014)

The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing. - Andreas M. Tillmann; Marc E. Pfetsch (IEEE Trans. Inf. Theory, 2014)

Chapter 5: Mathematical optimization for evaluating gas network capacities. - Alexander Martin 001; Lars Schewe; Thorsten Koch; Marc E. Pfetsch (Evaluating Gas Network Capacities, 2015)

Chapter 4: State of the art in evaluating gas network capacities. - Dagmar Bargmann; Mirko Ebbers; Nina Heinecke; Veronika Kühl; Antje Pelzer; Jessica Rövekamp; Klaus Spreckelsen; Thorsten Koch; Marc E. Pfetsch (Evaluating Gas Network Capacities, 2015)

Chapter 2: Physical and technical fundamentals of gas networks. - Armin Fügenschuh; Björn Geißler; Ralf Gollmer; Antonio Morsi; Jessica Rövekamp; Martin Schmidt 003; Klaus Spreckelsen; Marc Christian Steinbach; Marc E. Pfetsch (Evaluating Gas Network Capacities, 2015)

Chapter 12: Computational results for validation of nominations. - Jesco Humpola; Thomas Lehmann 003; Ralf Lenz; Antonio Morsi; Martin Schmidt 003; Robert Schwarz; Jonas Schweiger; Claudia Stangl; Bernhard M. Willert; Benjamin Hiller; Marc E. Pfetsch; Lars Schewe (Evaluating Gas Network Capacities, 2015)

Chapter 1: Introduction. - Jessica Rövekamp; Thorsten Koch; Marc E. Pfetsch (Evaluating Gas Network Capacities, 2015)

Symmetry Handling via Symmetry Breaking Polytopes. - Christopher Hojny; Marc E. Pfetsch (CTW, 2015)

Validation of nominations in gas network optimization: models, methods, and solutions. - Marc E. Pfetsch; Armin Fügenschuh; Björn Geißler; Nina Geißler; Ralf Gollmer; Benjamin Hiller; Jesco Humpola; Thorsten Koch; Thomas Lehmann 003; Alexander Martin 001; Antonio Morsi; Jessica Rövekamp; et al. (Optim. Methods Softw., 2015)

Solving Basis Pursuit: Heuristic Optimality Check and Solver Comparison. - Dirk A. Lorenz; Marc E. Pfetsch; Andreas M. Tillmann (ACM Trans. Math. Softw., 2015)

A fast, massively parallel solver for large, irregular pairwise Markov random fields. - Daniel Thuerck; Michael Waechter; Sven Widmer; Max von Buelow 001; Patrick Seemann; Marc E. Pfetsch; Michael Goesele (High Performance Graphics, 2016)

A Mixed-Integer Nonlinear Program for the Design of Gearboxes. - Lena C. Altherr; Bastian Dörig; Thorsten Ederer; Peter F. Pelz; Marc E. Pfetsch; Jan Wolf (OR, 2016)

A Compact Formulation for the ℓ2, 1 Mixed-Norm Minimization Problem. - Christian Steffens; Marius Pesavento; Marc E. Pfetsch (CoRR, 2016)

A polyhedral investigation of star colorings. - Christopher Hojny; Marc E. Pfetsch (Discret. Appl. Math., 2016)

A characterization of irreducible infeasible subsystems in flow networks. - Imke Joormann; James B. Orlin; Marc E. Pfetsch (Networks, 2016)

Joint active device identification and symbol detection using sparse constraints in massive MIMO systems. - Ganapati Hegde; Marius Pesavento; Marc E. Pfetsch (EUSIPCO, 2017)

A compact formulation for the l21 mixed-norm minimization problem. - Christian Steffens; Marius Pesavento; Marc E. Pfetsch (ICASSP, 2017)

Extended Formulations for Column Constrained Orbitopes. - Christopher Hojny; Marc E. Pfetsch; Andreas Schmitt (OR, 2017)

GasLib - A Library of Gas Network Instances. - Martin Schmidt 003; Denis Aßmann; Robert Burlacu; Jesco Humpola; Imke Joormann; Nikolaos Kanelakis; Thorsten Koch; Djamal Oucherif; Marc E. Pfetsch; Lars Schewe; Robert Schwarz; Mathias Sirvent (Data, 2017)

Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints. - Tobias Fischer 002; Marc E. Pfetsch (Oper. Res. Lett., 2017)

Joint Antenna Selection and Phase-only Beamforming using Mixed-Integer Nonlinear Programming. - Tobias Fischer 002; Ganapati Hegde; Frederic Matter; Marius Pesavento; Marc E. Pfetsch; Andreas M. Tillmann (WSA, 2018)

Complexity of minimum irreducible infeasible subsystem covers for flow networks. - Imke Joormann; Marc E. Pfetsch (Discret. Appl. Math., 2018)

Solving MIPs via scaling-based augmentation. - Pierre Le Bodic; Jeffrey William Pavelka; Marc E. Pfetsch; Sebastian Pokutta (Discret. Optim., 2018)

Branch-and-cut for linear programs with overlapping SOS1 constraints. - Tobias Fischer 002; Marc E. Pfetsch (Math. Program. Comput., 2018)

A framework for solving mixed-integer semidefinite programs. - Tristan Gally; Marc E. Pfetsch; Stefan Ulbrich (Optim. Methods Softw., 2018)

On the complexity of instationary gas flows. - Martin Groß 001; Marc E. Pfetsch; Martin Skutella (Oper. Res. Lett., 2018)

A Compact Formulation for the $ ell _{2, 1}$ Mixed-Norm Minimization Problem. - Christian Steffens; Marius Pesavento; Marc E. Pfetsch (IEEE Trans. Signal Process., 2018)

Exploiting Partial Convexity of Pump Characteristics in Water Network Design. - Marc E. Pfetsch; Andreas Schmitt (OR, 2019)

Block-sparse Recovery of Semidefinite Systems and Generalized Null Space Conditions. - Janin Heuer; Frederic Matter; Marc E. Pfetsch; Thorsten Theobald (CoRR, 2019)

Identification of Model Uncertainty via Optimal Design of Experiments applied to a Mechanical Press. - Tristan Gally; Peter Groche; Florian Hoppe; Anja Kuttich; Alexander Matei; Marc E. Pfetsch; Martin Rakowitsch; Stefan Ulbrich (CoRR, 2019)

Integrality of Linearizations of Polynomials over Binary Variables using Additional Monomials. - Christopher Hojny; Marc E. Pfetsch; Matthias Walter (CoRR, 2019)

Irreducible Infeasible Subsystems of Semidefinite Systems. - Kai Kellner; Marc E. Pfetsch; Thorsten Theobald (J. Optim. Theory Appl., 2019)

Polytopes associated with symmetry handling. - Christopher Hojny; Marc E. Pfetsch (Math. Program., 2019)

A computational comparison of symmetry handling methods for mixed integer programs. - Marc E. Pfetsch; Thomas Rehn (Math. Program. Comput., 2019)

Algorithmic results for potential-based flows: Easy and hard cases. - Martin Groß 001; Marc E. Pfetsch; Lars Schewe; Martin Schmidt 003; Martin Skutella (Networks, 2019)

Sparsity of integer formulations for binary programs. - Christopher Hojny; Hendrik Lüthen; Marc E. Pfetsch (Oper. Res. Lett., 2019)

Global Optimization of Mixed-Integer ODE Constrained Network Problems Using the Example of Stationary Gas Transport. - Oliver Habeck; Marc E. Pfetsch; Stefan Ulbrich (SIAM J. Optim., 2019)

IPBoost - Non-Convex Boosting via Integer Programming. - Marc E. Pfetsch; Sebastian Pokutta (ICML, 2020)

Knapsack polytopes: a survey. - Christopher Hojny; Tristan Gally; Oliver Habeck; Hendrik Lüthen; Frederic Matter; Marc E. Pfetsch; Andreas Schmitt (Ann. Oper. Res., 2020)

On the structure of linear programs with overlapping cardinality constraints. - Tobias Fischer 002; Marc E. Pfetsch (Discret. Appl. Math., 2020)

Sparse recovery with integrality constraints. - Jan-Hendrik Lange; Marc E. Pfetsch; Bianca M. Seib; Andreas M. Tillmann (Discret. Appl. Math., 2020)

Evaluation of Multiparametric Linear Programming for Economic Dispatch under Uncertainty. - Johannes Sindt; Allan Almeida Santos; Marc E. Pfetsch; Florian Steinke (ISGT-Europe, 2021)

Optimization of Wear Related Material Costs of a Hydrostatic Transmission System via MINLP. - Lena C. Altherr; Philipp Leise; Marc E. Pfetsch; Andreas Schmitt (OR, 2021)

Recovery under Side Constraints. - Khaled Ardah; Martin Haardt; Tianyi Liu; Frederic Matter; Marius Pesavento; Marc E. Pfetsch (CoRR, 2021)

Ambiguities in Direction-of-Arrival Estimation with Linear Arrays. - Frederic Matter; Tobias Fischer 002; Marius Pesavento; Marc E. Pfetsch (CoRR, 2021)

On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound Proofs. - Max Gläser; Marc E. Pfetsch (IPCO, 2022)

Estimating the Size of Branch-and-Bound Trees. - Gregor Hendel; Daniel Anderson; Pierre Le Bodic; Marc E. Pfetsch (INFORMS J. Comput., 2022)

Packing under convex quadratic constraints. - Max Klimm; Marc E. Pfetsch; Rico Raber; Martin Skutella (Math. Program., 2022)

Optimal patchings for consecutive ones matrices. - Marc E. Pfetsch; Giovanni Rinaldi; Paolo Ventura (Math. Program. Comput., 2022)

Combinatorial acyclicity models for potential-based flows. - Oliver Habeck; Marc E. Pfetsch (Networks, 2022)

Ambiguities in DoA Estimation With Linear Arrays. - Frederic Matter; Tobias Fischer 002; Marius Pesavento; Marc E. Pfetsch (IEEE Trans. Signal Process., 2022)

Joint Sparse Estimation with Cardinality Constraint via Mixed-Integer Semidefinite Programming. - Tianyi Liu; Frederic Matter; Alexander Sorg; Marc E. Pfetsch; Martin Haardt; Marius Pesavento (CAMSAP, 2023)

Handling Symmetries in Mixed-Integer Semidefinite Programs. - Christopher Hojny; Marc E. Pfetsch (CPAIOR, 2023)

Learning Cuts via Enumeration Oracles. - Daniel Thuerck; Boro Sofranac; Marc E. Pfetsch; Sebastian Pokutta (NeurIPS, 2023)

Reduction of Potential-Based Flow Networks. - Max Klimm; Marc E. Pfetsch; Rico Raber; Martin Skutella (Math. Oper. Res., 2023)

On the robustness of potential-based flow networks. - Max Klimm; Marc E. Pfetsch; Rico Raber; Martin Skutella (Math. Program., 2023)

A generic optimization framework for resilient systems. - Marc E. Pfetsch; Andreas Schmitt (Optim. Methods Softw., 2023)

Presolving for Mixed-Integer Semidefinite Optimization. - Frederic Matter; Marc E. Pfetsch (INFORMS J. Optim., 2023)

Physics informed neural networks: A case study for gas transport problems. - Erik Laurin Strelow; Alf Gerisch; Jens Lang 001; Marc E. Pfetsch (J. Comput. Phys., 2023)

Enabling Research through the SCIP Optimization Suite 8.0. - Ksenia Bestuzheva; Mathieu Besançon; Weikun Chen; Antonia Chmiela; Tim Donkiewicz; Jasper van Doornmalen; Leon Eifler; Oliver Gaul; Gerald Gamrath; Ambros M. Gleixner; Leona Gottwald; Christoph Graczyk; et al. (ACM Trans. Math. Softw., 2023)

Gridless Parameter Estimation in Partly Calibrated Rectangular Arrays. - Tianyi Liu; Sai Pavan Deram; Khaled Ardah; Martin Haardt; Marc E. Pfetsch; Marius Pesavento (ICASSP, 2024)

Sub-Exponential Lower Bounds for Branch-and-Bound with General Disjunctions via Interpolation. - Max Gläser; Marc E. Pfetsch (SODA, 2024)

Constrained C-Test Generation via Mixed-Integer Programming. - Ji-Ung Lee; Marc E. Pfetsch; Iryna Gurevych (CoRR, 2024)

On computing small variable disjunction branch-and-bound trees. - Max Gläser; Marc E. Pfetsch (Math. Program., 2024)

Valid Cuts for the Design of Potential-Based Flow Networks. - Pascal Börner; Max Klimm; Annette Lutz; Marc E. Pfetsch; Martin Skutella; Lea Strubberg (IPCO, 2025)

A New Relaxation for Tree-Based Problems and Minimum Power-Cost Spanning Trees. - Luzie Marianczuk; Ernst Althaus; Stefan Irnich; Marc E. Pfetsch (SEA, 2025)