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
The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
TL;DR: It is confirmed by showing that for a given matrix A and positive integer k, computing the best constants for which the RIP or NSP hold is, in general, NP-hard.
Posted Content
The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
TL;DR: In this article, it was shown that for a given matrix A and positive integer k, computing the best constants for which the restricted isometry property (RIP) or nullspace property (NSP) hold is NP-hard.
The SCIP Optimization Suite 7.0
Gerald Gamrath,Daniel Anderson,Ksenia Bestuzheva,Wei-Kun Chen,Leon Eifler,Maxime Gasse,Patrick Gemander,Ambros M. Gleixner,Leona Gottwald,Katrin Halbig,Gregor Hendel,Christopher Hojny,Thorsten Koch,Pierre Le Bodic,Stephen J. Maher,Frederic Matter,Matthias Miltenberger,Erik Muhmer,Benjamin Müller,Marc E. Pfetsch,Franziska Schlösser,Felipe Serrano,Yuji Shinano,Christine Maher Fouad Tawfik,Stefan Vigerske,Fabian Wegscheider,Dieter Weninger,Jakob Witzig +27 more
TL;DR: New features and enhanced algorithms made available in version 5.0 of the SCIP Optimization Suite, in particular for the LP solver SoPlex, the Steiner tree solver SCIP-Jack, the MISDP solverSCIP-SDP, and the parallelization framework UG are described.
Journal ArticleDOI
A Column-Generation Approach to Line Planning in Public Transport
TL;DR: A new multicommodity flow model for line planning is proposed, in comparison to existing models, that the passenger paths can be freely routed and lines are generated dynamically.
The SCIP Optimization Suite 5.0
Ambros M. Gleixner,Leon Eifler,Tristan Gally,Gerald Gamrath,Patrick Gemander,Robert L. Gottwald,Gregor Hendel,Christoper Hojny,Thorsten Koch,Matthias Miltenberger,Benjamin Müller,Marc E. Pfetsch,Christian Puchert,Daniel Rehfeldt,Franziska Schlösser,Felipe Serrano,Yuji Shinano,Jan Merlin Viernickel,Stefan Vigerske,Dieter Weninger,Jonas Witt,Jakob Witzig +21 more
TL;DR: The SCIP Optimization Suite 5.0 as discussed by the authors is the latest version of the constraint integer programming solver SCIP for solving mixed-integer linear and nonlinear programs, and it is about 41 % faster than SCIP 4.0 and over twice as fast on instances that take at least 100 seconds to solve.