Hauptinhalt

Artikel in Zeitschriften

• Parabolic optimal control problems with combinatorial switching constraints – Part III: Branch-and-bound algorithm.
  Computational Optimization and Applications, to appear
  (with A. Grütering and C. Meyer)


• Extended Formulations for Binary Optimal Control Problems.
  Mathematical Programming (Series A), to appear


• Parabolic optimal control problems with combinatorial switching constraints – Part II: Outer approximation algorithm.
  SIAM Journal on Optimization 34(2), pp 1295–1315 (2024)
  (with A. Grütering and C. Meyer)


• Parabolic optimal control problems with combinatorial switching constraints – Part I: Convex relaxations.
  SIAM Journal on Optimization 34(2), pp 1187–1205 (2024)
  (with A. Grütering and C. Meyer)


• An oracle-based framework for robust combinatorial optimization.
  Journal of Global Optimization 88, pp 27–51 (2024)
  (with E. Bettiol, M. De Santis, and F. Rinaldi)


• Bilevel linear optimization belongs to NP and admits polynomial-size KKT-based reformulations.
  Operations Research Letters 51(6), pp 618–622 (2023)


• The polytope of binary sequences with bounded variation.
  Discrete Optimization 48, pp 100776 (2023)
  (with M. Hügging)


• Conic optimization under combinatorial sparsity constraints.
  Operations Research Letters 50(6), pp 632–638 (2022)
  (with E. Traversi)


• On the complexity of the bilevel minimum spanning tree problem.
  Networks 80(3), pp 338–355 (2022)
  (with D. Henke and F. Hommelsheim)


• The stochastic bilevel continuous knapsack problem with uncertain follower’s objective.
  Journal of Optimization Theory and Applications 194, pp 521–542 (2022)
  (with D. Henke and J. Irmai)


• The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective.
  Journal of Global Optimization 83, pp 803–824 (2022)
  (with D. Henke)


• On the Stochastic Vehicle Routing Problem with time windows, correlated travel times, and time dependency.
  4OR 20, pp 217–239 (2022)
  (with F. Bomboi and J. Pruente)


• On the complexity of robust bilevel optimization with uncertain follower’s objective.
  Operations Research Letters 49(5), pp 703–707 (2021)
  (with D. Henke and F. Hommelsheim)


• Lower Bounds for Cubic Optimization over the Sphere.
  Journal of Optimization Theory and Applications 188, pp 823–846 (2021)
  (with M. Fampa and O. Sarmiento)


• Stochastic Single-Allocation Hub Location.
  European Journal of Operational Research 289(3), pp 1087–1106 (2021)
  (with B. Rostami, N. Kämmerling, J. Naoum-Sawaya, and U. Clausen)


• A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization.
  Discrete Applied Mathematics 285, pp 591–593 (2020)


• A Robust Approach to the Capacitated Vehicle Routing Problem with Uncertain Costs.
  INFORMS Journal on Optimization 2(2), pp 79–95 (2020)
  (with L. Eufinger, J. Kurtz, and U. Clausen)


• An Active Set Algorithm for Robust Combinatorial Optimization Based on Separation Oracles.
  Mathematical Programming Computation 11(4), pp 755–789 (2019)
  (with M. De Santis)


• K-Adaptability in Stochastic Combinatorial Optimization under Objective Uncertainty.
  European Journal of Operational Research 277(3), pp 953–963 (2019)
  (with J. Pruente)


• SDP-based Branch-and-Bound for Non-convex Quadratic Integer Optimization.
  Journal of Global Optimization 73(3), pp 485–514 (2019)
  (with M. Montenegro and A. Wiegele)


• Berge-acyclic multilinear 0–1 optimization problems.
  European Journal of Operational Research 273(1), pp 102–107 (2019)
  (with Y. Crama and E. Rodríguez-Heck)


• Robust Combinatorial Optimization under Convex and Discrete Cost Uncertainty.
  EURO Journal on Computational Optimization 6(3), pp 211–238 (2018)
  (with J. Kurtz)


• Reliable single allocation hub location problem under hub breakdowns.
  Computers & Operations Research 96, pp 15–29 (2018)
  (with B. Rostami, N. Kämmerling, and U. Clausen)


• Combinatorial Optimal Control of Semilinear Elliptic PDEs.
  Computational Optimization and Applications 70(3), pp 641–675 (2018)
  (with R. Kuhlmann and C. Meyer)


• The Quadratic Shortest Path Problem: Complexity, Approximability, and Solution Methods.
  European Journal of Operational Research 268(2), pp 473–485 (2018)
  (with B. Rostami, A. Chassein, M. Hopf, D. Frey, F. Malucelli, and M. Goerigk)


• Complexity of Min-max-min Robustness for Combinatorial Optimization Under Discrete Uncertainty.
  Discrete Optimization 28, pp 1–15 (2018)
  (with J. Kurtz)


• A Frank-Wolfe Based Branch-and-Bound Algorithm for Mean-Risk Optimization.
  Journal of Global Optimization 70(3), pp 625–644 (2018)
  (with M. De Santis, F. Rinaldi, and L. Trieu)


• Quadratic Combinatorial Optimization Using Separable Underestimators.
  INFORMS Journal on Computing 30(3) (2018)
  (with E. Traversi)


• Min-max-min Robust Combinatorial Optimization.
  Mathematical Programming (Series A) 163(1--2), pp 1–23 (2017)
  (with J. Kurtz)


• Monomial-wise Optimal Separable Underestimators for Mixed-Integer Polynomial Optimization.
  Journal of Global Optimization 67(4), pp 759–786 (2017)
  (with C. D'Ambrosio)


• A Feasible Active Set Method With Reoptimization for Convex Quadratic Mixed-Integer Programming.
  SIAM Journal on Optimization 26(3), pp 1695–1714 (2016)
  (with M. De Santis, S. Lucidi, F. Rinaldi, and L. Trieu)


• A Non-rigid Registration Method for the Efficient Analysis of Shape Deviations in Production Engineering Applications.
  Production Engineering 10(2), pp 137–146 (2016)
  (with M. Schweinoch, R. Schäfer, A. Sacharow, and D. Biermann)


• Robust Critical Node Selection by Benders Decomposition.
  INFORMS Journal on Computing 28(1), pp 162–174 (2016)
  (with J. Naoum-Sawaya)


• A Fast Branch-and-Bound Algorithm for Non-convex Quadratic Integer Optimization Subject To Linear Constraints Using Ellipsoidal Relaxations.
  Operations Research Letters 43, pp 384–388 (2015)
  (with M. De Santis and L. Palagi)


• An Error-Adaptive, Non-Rigid Registration Method for the Analysis of Springback in Sheet Metal Forming.
  Key Engineering Materials 651–653, pp 1015–1020 (2015)
  (with M. Schweinoch, A. Sacharow, and D. Biermann)


• Ellipsoid Bounds for Convex Quadratic Integer Programming.
  SIAM Journal on Optimization 25(2), pp 741–769 (2015)
  (with R. Hübner and A. Schöbel)


• On the Separation of Split Inequalities for Non-Convex Quadratic Integer Programming.
  Discrete Optimization 15, pp 1–14 (2015)
  (with E. Traversi)


• Combinatorial Optimization with One Quadratic Term: Spanning Trees and Forests.
  Discrete Applied Mathematics 177, pp 34–52 (2014)
  (with L. Klein)


• A Procedure for the Evaluation and Compensation of Form Errors by Means of Global Isometric Registration with Subsequent Local Reoptimization.
  Production Engineering 8, pp 81–89 (2014)
  (with L. Klein, T. Wagner, and D. Biermann)


• An Exact Algorithm for Nonconvex Quadratic Integer Minimization using Ellipsoidal Relaxations.
  SIAM Journal on Optimization 23(3), pp 1867–1889 (2013)
  (with M. De Santis, L. Palagi, and M. Piacentini)


• Semidefinite Relaxations for Non-Convex Quadratic Mixed-Integer Programming.
  Mathematical Programming (Series A) 141(1–2), pp 435–452 (2013)
  (with A. Wiegele)


• An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming.
  Mathematical Programming (Series A) 135(1–2), pp 369–395 (2012)
  (with A. Caprara and A. Lodi)


• Integer Programming Subject to Monomial Constraints
  SIAM Journal on Optimization 20(6), pp 3297–3311 (2010)
  (with D. Michaels and R. Weismantel)


• Speeding up IP-based Algorithms for Constrained Quadratic 0–1 Optimization
  Mathematical Programming (Series B) 124(1–2), pp 513–535 (2010)
  (with F. Liers and M. Oswald)


• Exact Algorithms for the Quadratic Linear Ordering Problem
  INFORMS Journal on Computing 22(1), pp 168–177 (2010)
  (with A. Wiegele and L. Zheng)


• Terse Integer Linear Programs for Boolean Optimization
  Journal on Satisfiability, Boolean Modeling and Computation 6, pp 121–139 (2009)
  (with G. Rinaldi)


• On the Subgroup Distance Problem
  Discrete Mathematics 309, pp 962–968 (2009)
  (with P. J. Cameron and T. Wu)


• Local Cuts Revisited
  Operations Research Letters 36, pp 430–433 (2008)
  (with F. Liers and M. Oswald)


• Testing Planarity of Geometric Automorphisms in Linear Time
  Algorithmica 52, pp 448–465 (2008)
  (with S. Hong)


• A Branch-and-Cut Approach to the Crossing Number Problem
  Discrete Optimization 5(2), pp 373–388 (2008)
  (with M. Chimani, D. Ebner, C. Gutwenger, M. Jünger, G. W. Klau, P. Mutzel, and R. Weiskircher)


• Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
  SIAM Journal on Optimization 18(4), pp 1398–1413 (2007)
  (with G. Rinaldi)


• Drawing Rooted Trees in Linear Time
  Software: Practice & Experience 36(6), pp 651–665 (2006)
  (with M. Jünger and S. Leipert)


• Linear Optimization over Permutation Groups
  Discrete Optimization 2(4), pp 308–319 (2005)
  (with M. Jünger)


• Crossing Minimization for Symmetries
  Theory of Computing Systems 38(3), pp 293–311 (2005)
  (with S. Hong)


• On the Complexity of Drawing Trees Nicely: Corrigendum
  Acta Informatica 40(8), pp 603–607 (2004)
  (with T. Akkerman, M. Jünger, and D. Teske)


• Réduction des tores déployés par une extension modérément ramifiée (Reduction of tori split over tamely ramified extensions)
  Comptes rendus Mathématique 338(3), pp 219–221 (2004)
  (with H. Frommer)


• Detecting Symmetries by Branch & Cut
  Mathematical Programming (Series B) 98, pp 369–384 (2003)
  (with M. Jünger)