#### Filter Results:

- Full text PDF available (59)

#### Publication Year

1999

2018

- This year (8)
- Last 5 years (36)
- Last 10 years (56)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Andreas M. Tillmann, Marc E. Pfetsch
- IEEE Transactions on Information Theory
- 2014

This paper deals with the computational complexity of conditions which guarantee that the NP-hard problem of finding the sparsest solution to an underdetermined linear system can be solved byâ€¦ (More)

- Michael Joswig, Marc E. Pfetsch
- SIAM J. Discrete Math.
- 2006

Morse matchings capture the essential structural information of discrete Morse functions. We show that computing optimal Morse matchings is NP-hard and give an integer programming formulation for theâ€¦ (More)

We introduce orbitopes as the convex hulls of 0/1-matrices that are lexicographically maximal subject to a group acting on the columns. Special cases are packing and partitioning orbitopes, whichâ€¦ (More)

- Gerald Gamrath, Tobias Fischer, +18 authors Jakob Witzig
- 2016

The SCIP Optimization Suite is a software toolbox for generating and solving various classes of mathematical optimization problems. Its major components are the modeling language ZIMPL, the linearâ€¦ (More)

- Marc E. Pfetsch
- SIAM Journal on Optimization
- 2008

This paper presents a branch-and-cut algorithm for the NPhard maximum feasible subsystem problem: For a given infeasible linear inequality system, determine a feasible subsystem containing as manyâ€¦ (More)

The line planning problem is one of the fundamental problems in strategic planning of public and rail transport. It consists of finding lines and corresponding frequencies in a public transportâ€¦ (More)

- Ralf BorndÃ¶rfer, Martin GrÃ¶tschel, Marc E. Pfetsch
- Transportation Science
- 2007

The line-planning problem is one of the fundamental problems in strategic planning of public and rail transport. It involves finding lines and corresponding frequencies in a transport network suchâ€¦ (More)

- Edoardo Amaldi, Marc E. Pfetsch, Leslie E. Trotter
- Math. Program.
- 2003

We consider the MAX FS problem: For a given infeasible linear system Ax â‰¤ b, determine a feasible subsystem containing as many inequalities as possible. This problem, which is NP-hard and alsoâ€¦ (More)

- Martin Schmidt, Denis AÃŸmann, +9 authors Mathias Sirvent
- 2015

Abstract. The development of mathematical simulation and optimization models and algorithms for solving gas transport problems is an active field of research. In order to test and compare theseâ€¦ (More)

We consider a multicommodity routing problem, where demands are released online and have to be routed in a network during specified time windows. The objective is to minimize a time and loadâ€¦ (More)