| Publication | Date of Publication | Type |
|---|
| Sub-exponential lower bounds for branch-and-bound with general disjunctions via interpolation | 2024-11-28 | Paper |
Ambiguities in DoA estimation with linear arrays
IEEE Transactions on Signal Processing | 2024-09-12 | Paper |
Enabling research through the SCIP Optimization Suite 8.0
ACM Transactions on Mathematical Software | 2024-09-10 | Paper |
On computing small variable disjunction branch-and-bound trees
Mathematical Programming. Series A. Series B | 2024-08-20 | Paper |
Reduction of Potential-Based Flow Networks
Mathematics of Operations Research | 2024-03-01 | Paper |
Combinatorial acyclicity models for potential‐based flows
Networks | 2023-12-11 | Paper |
| The Impact of Symmetry Handling for the Stable Set Problem via Schreier-Sims Cuts | 2023-11-10 | Paper |
Handling symmetries in mixed-integer semidefinite programs
Integration of Constraint Programming, Artificial Intelligence, and Operations Research | 2023-10-04 | Paper |
| Sub-Exponential Lower Bounds for Branch-and-Bound with General Disjunctions via Interpolation | 2023-08-08 | Paper |
Physics informed neural networks: a case study for gas transport problems
Journal of Computational Physics | 2023-04-26 | Paper |
On the robustness of potential-based flow networks
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
| Enabling Research through the SCIP Optimization Suite 8.0 | 2023-03-13 | Paper |
Recovery under side constraints
(available as arXiv preprint) | 2022-12-14 | Paper |
| Capacity evaluation for large-scale gas networks | 2022-10-25 | Paper |
Packing under convex quadratic constraints
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
| On the complexity of finding shortest variable disjunction branch-and-bound proofs | 2022-08-16 | Paper |
Estimating the Size of Branch-and-Bound Trees
INFORMS Journal on Computing | 2022-06-30 | Paper |
Identification of model uncertainty via optimal design of experiments applied to a mechanical press
Optimization and Engineering | 2022-05-11 | Paper |
Optimal patchings for consecutive ones matrices
Mathematical Programming Computation | 2022-04-14 | Paper |
Packing under convex quadratic constraints
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
| The SCIP Optimization Suite 8.0 | 2021-12-16 | Paper |
| Schreier-Sims Cuts meet Stable Set: Preserving Problem Structure when Handling Symmetries | 2021-11-15 | Paper |
Block-sparse recovery of semidefinite systems and generalized null space conditions
Linear Algebra and its Applications | 2020-08-28 | Paper |
Sparse recovery with integrality constraints
Discrete Applied Mathematics | 2020-06-29 | Paper |
Semi-automatically optimized calibration of internal combustion engines
Optimization and Engineering | 2020-03-04 | Paper |
On the structure of linear programs with overlapping cardinality constraints
Discrete Applied Mathematics | 2020-02-20 | Paper |
Sparsity of integer formulations for binary programs
Operations Research Letters | 2020-02-10 | Paper |
Global optimization of mixed-integer ODE constrained network problems using the example of stationary gas transport
SIAM Journal on Optimization | 2019-12-09 | Paper |
| Integrality of Linearizations of Polynomials over Binary Variables using Additional Monomials | 2019-11-15 | Paper |
Maximizing the storage capacity of gas networks: a global MINLP approach
Optimization and Engineering | 2019-10-29 | Paper |
Algorithmic results for potential‐based flows: Easy and hard cases
Networks | 2019-07-30 | Paper |
On the complexity of instationary gas flows
Operations Research Letters | 2019-06-11 | Paper |
Irreducible infeasible subsystems of semidefinite systems
Journal of Optimization Theory and Applications | 2019-06-07 | Paper |
Polytopes associated with symmetry handling
Mathematical Programming. Series A. Series B | 2019-05-17 | Paper |
A computational comparison of symmetry handling methods for mixed integer programs
Mathematical Programming Computation | 2019-05-03 | Paper |
Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints
Operations Research Letters | 2019-02-22 | Paper |
A Compact Formulation for the $\ell _{2,1}$ Mixed-Norm Minimization Problem
IEEE Transactions on Signal Processing | 2019-02-12 | Paper |
Solving MIPs via scaling-based augmentation
Discrete Optimization | 2018-08-17 | Paper |
Branch-and-cut for linear programs with overlapping SOS1 constraints
Mathematical Programming Computation | 2018-06-25 | Paper |
Complexity of minimum irreducible infeasible subsystem covers for flow networks
Discrete Applied Mathematics | 2018-05-24 | Paper |
A characterization of irreducible infeasible subsystems in flow networks
Networks | 2018-05-23 | Paper |
A framework for solving mixed-integer semidefinite programs
Optimization Methods & Software | 2018-05-03 | Paper |
A mixed-integer nonlinear program for the design of gearboxes
Operations Research Proceedings 2016 | 2017-12-01 | Paper |
On the Complexity of Instationary Gas Flows
(available as arXiv preprint) | 2017-08-29 | Paper |
Solving basis pursuit: heuristic optimality check and solver comparison
ACM Transactions on Mathematical Software | 2017-06-30 | Paper |
The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Mathematical optimization for evaluating gas network capacities
Evaluating Gas Network Capacities | 2016-07-20 | Paper |
State of the art in evaluating gas network capacities
Evaluating Gas Network Capacities | 2016-07-20 | Paper |
Chapter 12: Computational results for validation of nominations
Evaluating Gas Network Capacities | 2016-07-20 | Paper |
A polyhedral investigation of star colorings
Discrete Applied Mathematics | 2016-05-18 | Paper |
Validation of nominations in gas network optimization: models, methods, and solutions
Optimization Methods & Software | 2015-09-04 | Paper |
Progress in Academic computational integer programming
Facets of Combinatorial Optimization | 2015-07-22 | Paper |
An infeasible-point subgradient method using adaptive approximate projections
Computational Optimization and Applications | 2014-10-10 | Paper |
The Steiner connectivity problem
Mathematical Programming. Series A. Series B | 2014-02-03 | Paper |
A heuristic and an exact method for the gate matrix connection cost minimization problem
International Transactions in Operational Research | 2013-11-14 | Paper |
Line planning on tree networks with applications to the Quito Trolebús system
International Transactions in Operational Research | 2013-03-19 | Paper |
Computing the bounded subcomplex of an unbounded polyhedron
Computational Geometry | 2013-03-12 | Paper |
Models for fare planning in public transport
Discrete Applied Mathematics | 2012-11-22 | Paper |
| Line planning on paths and tree networks with applications to the Quito trolebús system | 2012-09-28 | Paper |
Orbitopal fixing
Discrete Optimization | 2012-04-05 | Paper |
The maximum \(k\)-colorable subgraph problem and orbitopes
Discrete Optimization | 2012-03-07 | Paper |
Branch-cut-and-propagate for the maximum \(k\)-colorable subgraph problem with symmetry
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems | 2011-05-26 | Paper |
Heuristics for budget facility location-network design problems with minisum objective
Operations Research Proceedings 2008 | 2011-04-07 | Paper |
The line connectivity problem
Operations Research Proceedings 2008 | 2011-04-07 | Paper |
Detecting orbitopal symmetries
Operations Research Proceedings 2008 | 2011-04-07 | Paper |
Sparse approximate solution of partial differential equations
Applied Numerical Mathematics | 2010-05-25 | Paper |
Exact and approximate sparse solutions of underdetermined linear equations
SIAM Journal on Scientific Computing | 2010-03-10 | Paper |
Competitive online multicommodity routing
Theory of Computing Systems | 2009-09-02 | Paper |
Branch-and-Cut for the Maximum Feasible Subsystem Problem
SIAM Journal on Optimization | 2009-03-06 | Paper |
| Models for line planning in public transport | 2008-09-12 | Paper |
Packing and partitioning orbitopes
Mathematical Programming. Series A. Series B | 2008-06-03 | Paper |
Competitive Online Multicommodity Routing
Approximation and Online Algorithms | 2008-02-21 | Paper |
Orbitopal Fixing
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
Computing Optimal Discrete Morse Functions
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
| scientific article; zbMATH DE number 5117501 (Why is no real title available?) | 2007-01-22 | Paper |
| scientific article; zbMATH DE number 5117514 (Why is no real title available?) | 2007-01-22 | Paper |
Computing Optimal Morse Matchings
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
| scientific article; zbMATH DE number 2186837 (Why is no real title available?) | 2005-07-07 | Paper |
scientific article; zbMATH DE number 1961535 (Why is no real title available?)
(available as arXiv preprint) | 2003-08-07 | Paper |
On the maximum feasible subsystem problem, IISs and IIS-hypergraphs
Mathematical Programming. Series A. Series B | 2003-07-13 | Paper |
Computing the face lattice of a polytope from its vertex-facet incidences
Computational Geometry | 2003-03-10 | Paper |
Ambiguous incidences of unbounded polyhedra
Electronic Geometry Model | 2002-01-23 | Paper |
Examples for generalized antiweb-facets
Electronic Geometry Model | 2002-01-23 | Paper |
Vertex-facet incidences of unbounded polyhedra
Advances in Geometry | 2001-07-17 | Paper |
Vertex-facet incidences of unbounded polyhedra
Advances in Geometry | 2001-07-17 | Paper |
Vertex-facet incidences of unbounded polyhedra
Advances in Geometry | 2001-07-17 | Paper |
| scientific article; zbMATH DE number 1342119 (Why is no real title available?) | 1999-11-21 | Paper |
Learning Cuts via Enumeration Oracles
(available as arXiv preprint) | N/A | Paper |
The SCIP Optimization Suite 9.0
(available as arXiv preprint) | N/A | Paper |
