Publications of Marc Pfetsch
2013
2012
-
Validation of Nominations in Gas Network Optimization: Models, Methods, and Solutions
together with
A. Fügenschuh, B. Geißler, N. Geißler, R. Gollmer, B. Hiller, J. Humpola, T. Koch, T. Lehmann, A. Martin
A. Morsi, J. Rövekamp, L. Schewe, M. Schmidt, R. Schultz, R. Schwarz, J. Schweiger, C. Stangl, M. C. Steinbach,
S. Vigerske, B. M. Willert
Optimization Online
-
Models for fare planning in public transport
together with
Ralf Borndörfer and
Marika Karbstein
Discrete Applied Mathematics 160, No. 18 (2012), 2591-2605.
Preprint version:
ZIB Report 08-16
-
The Steiner Connectivity Problem
together with
Ralf Borndörfer and
Marika Karbstein
to appear in Math. Program.
Preprint version:
ZIB Report 09-07
-
The Computational Complexity of RIP, NSP, and Related Concepts in Compressed Sensing
together with
Andreas Tillmann
arXiv math.OC ⁄ 1205.2081
2011
-
Optimierung Technischer Kapazitäten in Gasnetzen
together with
A. Martin, B. Geißler, C. Hayn, A. Morsi, L. Schewe,
B. Hiller, J. Humpola, T. Koch, T. Lehmann, R. Schwarz,
J. Schweiger, M. Schmidt, M. Steinbach,
B. Willert, R. Schultz
in "Optimierung in der Energiewirtschaft", VDI-Berichte 2157, 105-114, 2011
-
Orbitopal Fixing
together with
Volker Kaibel and
Matthias Peinhardt
Discrete Optimization 8, No. 4, 595-610 (2011)
arXiv math.OC ⁄ 0611531
-
Solving Basis Pursuit: Subgradient Algorithm, Heuristic Optimality Check, and Solver Comparison
(formerly: "Infeasible-Point Subgradient Algorithm and Computational Solver Comparison for l1-Minimization")
together with
Dirk Lorenz and
Andreas Tillmann
Optimization Online
Software and results are available on the SPEAR webpage.
-
Line Planning on Paths and Tree Networks with Applications to the Quito Trolebús System
together with
Luis M. Torres, Ramiro Torres, and Ralf Borndörfer
Intl. Trans. Oper. Res. 18, 455-472 (2011)
[ PDF ]
(an extended version appears as
ZIB Report 08-35
)
-
Large Neighborhood Search beyond MIP
together with
Timo Berthold,
Stefan Heinz, and
Stefan Vigerske
Proceedings of the 9th Metaheuristics International Conference (MIC 2011), 51-60 (2011)
Preprint version:
ZIB Report 11-21
-
The Maximum k-Colorable Subgraph Problem and Orbitopes
together with
Tim Januschowski
Discrete Optimization 8, No. 3 (2011), 478-494
Preprint version:
Optimization Online
-
An Infeasible-Point Subgradient Method Using Adaptive Approximate Projections
(formerly: "An Infeasible-Point Subgradient Method Using Approximate Projections")
together with
Dirk Lorenz and
Andreas Tillmann
Optimization Online
-
Branch-Cut-and-Propagate for the Maximum k-Colorable Subgraph Problem with Symmetry
together with
Tim Januschowski
in Proc. 8th International Conference, CPAIOR 2011, Berlin, T. Achterberg and J. Ch. Beck, eds,
Lecture Notes in Computer Science 6697, Springer, 99-116
Preprint version:
Optimization Online
-
Disruption Management with Rescheduling of Trips and Vehicle Circulations
together with
Sandor P. Fekete, Alexander Kröller, Martin Lorek
Proc. 5th ASME/ASCE/IEEE Joint Rail Conference 2011 (JRC 2011), 395-404
Preprint version:
arXiv math.CO ⁄ 1101.2123
2010
2009
-
Competitive Online Multicommodity Routing
together with
Tobias Harks and
Stefan Heinz
Theory of Computing Systems 45, No. 3 (2009), 533-554
Preprint version:
ZIB Report 07-16
-
Nonlinear pseudo-Boolean optimization: relaxation or propagation?
together with
Timo Berthold and
Stefan Heinz
In Theory and Applications of Satisfiability Testing, SAT 2009, Oliver Kullmann ed.,
Lecture Notes in Computer Science 5584, Springer-Verlag (2009), 441-446
Preprint version:
ZIB Report 09-11
-
Detecting Orbitopal Symmetries
together with
Timo Berthold
In Operations Research Proceedings 2008,
B. Fleischmann, K. H. Borgwardt, R. Klein, and A. Tuma eds.,
Springer-Verlag (2009), 433-438
Preprint version:
ZIB Report 08-33
-
The Line Connectivity Problem
together with
Ralf Borndörfer and
Marika Neumann
In Operations Research Proceedings 2008,
B. Fleischmann, K. H. Borgwardt, R. Klein, and A. Tuma eds.,
Springer-Verlag (2009), 557-562
Preprint version:
ZIB Report 08-31
2008
-
Line Planning on Paths and Tree Networks with Applications to the Quito Trolebús System
together with
Luis M. Torres, Ramiro Torres, and Ralf Borndörfer
ZIB Report 08-35
-
On the Line Planning Problem in Tree Networks
together with
Luis M. Torres, Ramiro Torres, and Ralf Borndörfer
ZIB Report 08-52
-
Exact and Approximate Sparse Solutions of Underdetermined Linear Equations
together with
Sadegh Jokar
SIAM J. Sci. Comput. Volume 31, Issue 1, pp. 23-44 (2008)
Preprint version:
ZIB Report 07-05
-
Line Planning on Paths and Tree Networks with Applications to the Quito Trolebús System (Extended Abstract)
together with
Luis M. Torres, Ramiro Torres, and Ralf Borndörfer
in Proc. ATMOS 2008 - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems,
Matteo Fischetti and Peter Widmayer eds., Dagstuhl Research Online Publication Server, 2008
DROPS Publication 1583
[ATMOS 2008 Proceedings], also available as
ZIB Report 08-53
-
Computational Aspects of Combinatorial Optimization
Cumulative Habilitation Thesis, TU Berlin, 2008
[ PDF ]
-
Packing and Partitioning Orbitopes
together with
Volker Kaibel
Math. Program. 114, no. 1 (2008), 1-36
Preprint version:
ZIB Report 06-17,
arXiv math.OC ⁄ 0603678,
Optimization Online
-
Solving Pseudo-Boolean Problems with SCIP
together with
Timo Berthold and
Stefan Heinz
ZIB Report 08-12
-
Branch-And-Cut for the Maximum Feasible Subsystem Problem
SIAM Journal on Optimization 19, No.1, 21-38 (2008)
Preprint version:
ZIB Report 05-46
-
Models for Line Planning in Public Transport
together with
Ralf Borndörfer and
Martin Grötschel
Computer-aided Systems in Public Transport
M. Hickman, P. Mirchandani, and S. Voß (eds.),
Lecture Notes in Economics and Mathematical Systems 600, Springer-Verlag, 363-378 (2008)
Preprint version:
ZIB Report 04-10
-
Angebotsplanung im öffentlichen Nahverkehr
together with
Ralf Borndörfer and
Marika Neumann
Proc. HEUREKA '08 - Optimierung in Verkehr und Transport
FGSV Verlag, Köln
Preprint version:
ZIB Report 08-04
2007
2006
-
Competitive Online Multicommodity Routing
together with
Tobias Harks and
Stefan Heinz
Proc. Workshop on Approximation and Online Algorithms WAOA 2006,
Th. Erlebach and Ch. Kaklamanis (eds.), LNCS 4368, Springer-Verlag (2006), 240-252
Preprint version:
ZIB Report 06-27
-
Public Transport to the fORe!
together with
Ralf Borndörfer and
Martin Grötschel
OR ⁄ MS Today,
Vol. 33, No. 2, 30-40 (April 2006)
Preprint version:
ZIB Report 05-22
-
Routing in Line Planning for PublicTransport
together with
Ralf Borndörfer
Operations Research Proceedings 2005, H.-D. Haasis et. al. (eds.), Springer-Verlag (2006), 405-410
Preprint version:
ZIB Report 05-36
-
Optimal Fares for Public Transport
together with
Ralf Borndörfer and
Marika Neumann
Operations Research Proceedings 2005, H.-D. Haasis et. al. (eds.), Springer-Verlag (2006), 591-596
Preprint version:
ZIB Report 05-35
-
Computing Optimal Morse Matchings
together with
Michael Joswig
SIAM J. Discrete Math. 20, no. 1 (2006), 11-25
Preprint version:
ZIB Report 04-37,
arXiv math.CO ⁄ 0408331
2005
2003
-
On the maximum feasible subsystem problem, IISs, and IIS-hypergraphs
together with
Edoardo Amaldi and
Leslie E. Trotter, Jr.,
Math. Program. 95, Nr. 3, 533-554 (2003)
[ PS, PDF ]
-
Some Algorithmic Problems in Polytope Theory
together with Volker Kaibel,
in "Algebra, Geometry, and Software Systems",
Michael Joswig and Nobuki Takayama, eds.,
Springer-Verlag, 2003, 23-47
[ PS, PDF ]
2002
-
The Maximum Feasible Subsystem Problem and Vertex-Facet Incidences of Polyhedra
Dissertation, TU Berlin, 2002
Appeared as Online Publication of the TU Berlin
[abstract].
[ PS, PDF ]
-
Computing the Face Lattice of a Polytope from its Vertex-Facet Incidences
together with Volker Kaibel,
Comput. Geom. 23, Nr. 3, 281-290 (2002)
[ PS, PDF ]
2001
2000
1999
-
Some structural and algorithmic properties of the maximum
feasible subsystem problem
together with
Edoardo Amaldi
and
Leslie E. Trotter, Jr.,
Proceedings of the Integer Programming and Combinatorial Optimization Conference (IPCO '99),
Lecture Notes in Computer Science (LCNS) vol. 1610,
Springer-Verlag, 45-59 (1999)