scispace - formally typeset
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
Book ChapterDOI

Packing under convex quadratic constraints

TL;DR: It is proved that these problems are APX-hard to approximate and constant-factor approximation algorithms based upon three different algorithmic techniques based upon a rounding technique tailored to a convex relaxation in conjunction with a non-convex relaxation whose approximation ratio equals the golden ratio are presented.
Posted Content

Projection onto the Cosparse Set is NP-Hard

TL;DR: In this article, the computational complexity of the projection onto the set of cosparse vectors w.r.t. some given matrix was studied and it was shown that this problem is NP-hard, even in the special cases in which the matrix contains only ternary or bipolar coefficients.
Book ChapterDOI

Finding the Best: Mathematical Optimization Based on Product and Process Requirements

TL;DR: A variety of mathematical optimization methods is comprised within the field of engineering design optimization (EDO) and these methods include minimizing or maximizing the objective function by finding the optimal variables of the solution.
Book ChapterDOI

Extended Formulations for Column Constrained Orbitopes

TL;DR: This paper develops extended formulations of the resulting polytopes and presents numerical results that show their effect on the LP relaxation of a graph partitioning problem.