M
Marc E. Pfetsch
Researcher at Technische Universität Darmstadt
Publications - 156
Citations - 3926
Marc E. Pfetsch is an academic researcher from Technische Universität Darmstadt. The author has contributed to research in topics: Polytope & Integer programming. The author has an hindex of 29, co-authored 146 publications receiving 3294 citations. Previous affiliations of Marc E. Pfetsch include Braunschweig University of Technology & Zuse Institute Berlin.
Papers
More filters
Journal ArticleDOI
GasLib—A Library of Gas Network Instances
Martin Schmidt,Denis Aßmann,Robert Burlacu,Jesco Humpola,Imke Joormann,Nikolaos Kanelakis,Thorsten Koch,Djamal Oucherif,Marc E. Pfetsch,Lars Schewe,Robert Schwarz,Mathias Sirvent +11 more
TL;DR: The goal of GasLib is to provide a set of publicly available gas network instances that can be used by researchers in the field of gas transport to save time and compare different models and algorithms on the same specified test sets.
The SCIP Optimization Suite 3.2
Gerald Gamrath,Tobias Fischer,Tristan Gally,Ambros M. Gleixner,Gregor Hendel,Thorsten Koch,Stephen J. Maher,Matthias Miltenberger,Benjamin Müller,Marc E. Pfetsch,Christian Puchert,Daniel Rehfeld,Sebastian Schenker,Robert Schwarz,Felipe Serrano,Yuji Shinano,Stefan Vigerske,Dieter Wenninger,Michael Winkler,Jonas Witt,Jakob Witzig +20 more
TL;DR: This paper highlights the new features of version 3.2 of the SCIP Optimization Suite and presents new and improved extensions of SCIP, namely solvers for multi-criteria optimization, Steiner tree problems, and mixed-integer semidefinite programs.
Journal ArticleDOI
Computing Optimal Morse Matchings
Michael Joswig,Marc E. Pfetsch +1 more
TL;DR: It is shown that computing optimal Morse matchings is \NP-hard and an integer programming formulation for the problem is given and polyhedral results for the corresponding polytope are presented.
Journal ArticleDOI
A framework for solving mixed-integer semidefinite programs
TL;DR: It is demonstrated that practically relevant MISDPs can successfully be solved using a general purpose solver, and the applicability of an implementation of the proposed methods on three kinds of problems is shown.
Book ChapterDOI
Some Algorithmic Problems in Polytope Theory
Volker Kaibel,Marc E. Pfetsch +1 more
TL;DR: In this article, the authors collected 35 problems in the theory of convex polytopes and briefly discussed the current knowledge on their complexity status and the current state of the art.