Marc E. Pfetsch

Florian Steinke

Proceedings of the IEEE PES Innovative Smart Grid Technologies Europe, 2021

2020

Sparse recovery with integrality constraints.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

On the structure of linear programs with overlapping cardinality constraints.

[BibT_eX]

[DOI]

Tobias Fischer

Discret. Appl. Math., 2020

Knapsack polytopes: a survey.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2020

IPBoost - Non-Convex Boosting via Integer Programming.

[BibT_eX]

[DOI]

Sebastian Pokutta

Proceedings of the 37th International Conference on Machine Learning, 2020

2019

Global Optimization of Mixed-Integer ODE Constrained Network Problems Using the Example of Stationary Gas Transport.

[BibT_eX]

[DOI]

Oliver Habeck

Stefan Ulbrich

SIAM J. Optim., 2019

Sparsity of integer formulations for binary programs.

[BibT_eX]

[DOI]

Hendrik Lüthen

Oper. Res. Lett., 2019

Algorithmic results for potential-based flows: Easy and hard cases.

[BibT_eX]

[DOI]

Networks, 2019

A computational comparison of symmetry handling methods for mixed integer programs.

[BibT_eX]

[DOI]

Thomas Rehn

Math. Program. Comput., 2019

Polytopes associated with symmetry handling.

[BibT_eX]

[DOI]

Math. Program., 2019

Irreducible Infeasible Subsystems of Semidefinite Systems.

[BibT_eX]

[DOI]

Kai Kellner

Thorsten Theobald

J. Optim. Theory Appl., 2019

Integrality of Linearizations of Polynomials over Binary Variables using Additional Monomials.

[BibT_eX]

[DOI]

Matthias Walter

CoRR, 2019

Identification of Model Uncertainty via Optimal Design of Experiments applied to a Mechanical Press.

[BibT_eX]

[DOI]

CoRR, 2019

Block-sparse Recovery of Semidefinite Systems and Generalized Null Space Conditions.

[BibT_eX]

[DOI]

CoRR, 2019

Exploiting Partial Convexity of Pump Characteristics in Water Network Design.

[BibT_eX]

[DOI]

Andreas Schmitt

Proceedings of the Operations Research Proceedings 2019, 2019

2018

A Compact Formulation for the $\ell _{2, 1}$ Mixed-Norm Minimization Problem.

[BibT_eX]

[DOI]

Christian Steffens

IEEE Trans. Signal Process., 2018

On the complexity of instationary gas flows.

[BibT_eX]

[DOI]

Martin Groß

Martin Skutella

Oper. Res. Lett., 2018

A framework for solving mixed-integer semidefinite programs.

[BibT_eX]

[DOI]

Tristan Gally

Stefan Ulbrich

Optim. Methods Softw., 2018

Branch-and-cut for linear programs with overlapping SOS1 constraints.

[BibT_eX]

[DOI]

Tobias Fischer

Math. Program. Comput., 2018

Solving MIPs via scaling-based augmentation.

[BibT_eX]

[DOI]

Pierre Le Bodic

Jeffrey William Pavelka

Sebastian Pokutta

Discret. Optim., 2018

Complexity of minimum irreducible infeasible subsystem covers for flow networks.

[BibT_eX]

[DOI]

Imke Joormann

Discret. Appl. Math., 2018

Joint Antenna Selection and Phase-only Beamforming using Mixed-Integer Nonlinear Programming.

[BibT_eX]

[DOI]

Proceedings of the 22nd International ITG Workshop on Smart Antennas, 2018

2017

Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints.

[BibT_eX]

[DOI]

Tobias Fischer

Oper. Res. Lett., 2017

GasLib - A Library of Gas Network Instances.

[BibT_eX]

[DOI]

Data, 2017

Extended Formulations for Column Constrained Orbitopes.

[BibT_eX]

[DOI]

Andreas Schmitt

Proceedings of the Operations Research Proceedings 2017, 2017

A compact formulation for the l21 mixed-norm minimization problem.

[BibT_eX]

[DOI]

Christian Steffens

Proceedings of the 2017 IEEE International Conference on Acoustics, 2017

Joint active device identification and symbol detection using sparse constraints in massive MIMO systems.

[BibT_eX]

[DOI]

Ganapati Hegde

Proceedings of the 25th European Signal Processing Conference, 2017

2016

A characterization of irreducible infeasible subsystems in flow networks.

[BibT_eX]

[DOI]

Imke Joormann

James B. Orlin

Networks, 2016

A polyhedral investigation of star colorings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

A Compact Formulation for the ℓ<sub>2, 1</sub> Mixed-Norm Minimization Problem.

[BibT_eX]

[DOI]

Christian Steffens

CoRR, 2016

A Mixed-Integer Nonlinear Program for the Design of Gearboxes.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2016, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Helmut Schmidt University Hamburg, Germany, August 30, 2016

A fast, massively parallel solver for large, irregular pairwise Markov random fields.

[BibT_eX]

[DOI]

Proceedings of High Performance Graphics, 2016

2015

Solving Basis Pursuit: Heuristic Optimality Check and Solver Comparison.

[BibT_eX]

[DOI]

Dirk A. Lorenz

ACM Trans. Math. Softw., 2015

Validation of nominations in gas network optimization: models, methods, and solutions.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2015

Symmetry Handling via Symmetry Breaking Polytopes.

[BibT_eX]

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

Chapter 1: Introduction.

[BibT_eX]

[DOI]

Jessica Rövekamp

Thorsten Koch

Proceedings of the Evaluating Gas Network Capacities, 2015

Chapter 12: Computational results for validation of nominations.

[BibT_eX]

[DOI]

Proceedings of the Evaluating Gas Network Capacities, 2015

Chapter 2: Physical and technical fundamentals of gas networks.

[BibT_eX]

[DOI]

Marc Christian Steinbach

Proceedings of the Evaluating Gas Network Capacities, 2015

Chapter 4: State of the art in evaluating gas network capacities.

[BibT_eX]

[DOI]

Proceedings of the Evaluating Gas Network Capacities, 2015

Chapter 5: Mathematical optimization for evaluating gas network capacities.

[BibT_eX]

[DOI]

Proceedings of the Evaluating Gas Network Capacities, 2015

2014

The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

An infeasible-point subgradient method using adaptive approximate projections.

[BibT_eX]

[DOI]

Dirk A. Lorenz

Comput. Optim. Appl., 2014

Projection onto the cosparse set is NP-hard.

[BibT_eX]

[DOI]

Rémi Gribonval

Proceedings of the IEEE International Conference on Acoustics, 2014

2013

The Steiner connectivity problem.

[BibT_eX]

[DOI]

Marika Karbstein

Math. Program., 2013

A heuristic and an exact method for the gate matrix connection cost minimization problem.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2013

Projection Onto The k-Cosparse Set is NP-Hard

[BibT_eX]

[DOI]

Rémi Gribonval

CoRR, 2013

Computing the bounded subcomplex of an unbounded polyhedron.

[BibT_eX]

[DOI]

Sven Herrmann

Michael Joswig

Comput. Geom., 2013

2012

Models for fare planning in public transport.

[BibT_eX]

[DOI]

Marika Karbstein

Discret. Appl. Math., 2012

The Computational Complexity of RIP, NSP, and Related Concepts in Compressed Sensing

[BibT_eX]

[DOI]

CoRR, 2012

2011

Line planning on tree networks with applications to the Quito Trolebús system.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2011

Orbitopal fixing.

[BibT_eX]

[DOI]

Volker Kaibel

Matthias Peinhardt

Discret. Optim., 2011

The maximum k-colorable subgraph problem and orbitopes.

[BibT_eX]

[DOI]

Tim Januschowski

Discret. Optim., 2011

Disruption Management with Rescheduling of Trips and Vehicle Circulations

[BibT_eX]

[DOI]

CoRR, 2011

Branch-Cut-and-Propagate for the Maximum <i>k</i>-Colorable Subgraph Problem with Symmetry.

[BibT_eX]

[DOI]

Tim Januschowski

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2011

2009

Competitive Online Multicommodity Routing.

[BibT_eX]

[DOI]

Tobias Harks

Stefan Heinz

Theory Comput. Syst., 2009

Nonlinear Pseudo-Boolean Optimization: Relaxation or Propagation?.

[BibT_eX]

[DOI]

Timo Berthold

Stefan Heinz

Proceedings of the Theory and Applications of Satisfiability Testing, 2009

Line Planning and Connectivity.

[BibT_eX]

[DOI]

Marika Neumann

Proceedings of the Models and Algorithms for Optimization in Logistics, 21.06., 2009

2008

Exact and Approximate Sparse Solutions of Underdetermined Linear Equations.

[BibT_eX]

[DOI]

Sadegh Jokar

SIAM J. Sci. Comput., 2008

Branch-and-Cut for the Maximum Feasible Subsystem Problem.

[BibT_eX]

[DOI]

SIAM J. Optim., 2008

Line Planning on Paths and Tree Networks with Applications to the Quito Trolebús System.

[BibT_eX]

[DOI]

Proceedings of the ATMOS 2008, 2008

2007

A Column-Generation Approach to Line Planning in Public Transport.

[BibT_eX]

[DOI]

Martin Grötschel

Transp. Sci., 2007

2006

Computing Optimal Morse Matchings.

[BibT_eX]

[DOI]

Michael Joswig

SIAM J. Discret. Math., 2006

2005

Routing in Line Planning for Public Transport.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2005, 2005

Optimal Fares for Public Transport.

[BibT_eX]

[DOI]

Marika Neumann

Proceedings of the Operations Research Proceedings 2005, 2005

2004

Computing Optimal Discrete Morse Functions.

[BibT_eX]

[DOI]

Michael Joswig

Electron. Notes Discret. Math., 2004

2003

On the maximum feasible subsystem problem, IISs and IIS-hypergraphs.

[BibT_eX]

[DOI]

Edoardo Amaldi

Leslie E. Trotter Jr.

Math. Program., 2003

Some Algorithmic Problems in Polytope Theory.

[BibT_eX]

Volker Kaibel

Proceedings of the Algebra, Geometry, and Software Systems [outcome of a Dagstuhl seminar], 2003

2002

Computing the face lattice of a polytope from its vertex-facet incidences.

[BibT_eX]

[DOI]

Volker Kaibel

Comput. Geom., 2002

1999

Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem.

[BibT_eX]

[DOI]

Edoardo Amaldi