Hauptinhalt

Artikel in Konferenzbänden

• Partitioned vs. Integrated Planning of Hinterland Networks for LCL Transportation.
  ICPLT 2023: Advances in Resilient and Sustainable Transport, Lecture Notes in Logistics, pp 257–273 (2023)
  (with N. Jost, D. Henke, I. Hedtke, O. Bredtmann, J. Weise, and U. Clausen )


• Bounded variation in binary sequences.
  International Symposium on Combinatorial Optimization – ISCO 2022, LNCS 13526, pp 64–75 (2022)
  (with M. Hügging)


• The Robust Bilevel Continuous Knapsack Problem.
  17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization -- CTW 2019, pp 17–20 (2019)
  (with D. Henke)


• Tractable Relaxations for the Cubic One-spherical Optimization Problem.
  Optimization of Complex Systems: Theory, Models, Algorithms and Applications -- WCGO 2019, Advances in Intelligent Systems and Computing 991, pp 267–276 (2020)
  (with M. Fampa and O. Sarmiento)


• Complexity of K-Adaptable Stochastic Programming.
  15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization -- CTW 2017, pp 27–30 (2017)
  (with J. Pruente)


• A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs.
  International Symposium on Combinatorial Optimization – ISCO 2016, LNCS 9849, pp 110–122 (2016)
  (with M. Montenegro and A. Wiegele)


• A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels.
  International Symposium on Combinatorial Optimization – ISCO 2016, LNCS 9849, pp 237–248 (2016)
  (with B. Rostami and C. Strothmann)


• On the Quadratic Shortest Path Problem.
  14th International Symposium on Experimental Algorithms – SEA 2015, LNCS 9125, pp 379–390 (2015)
  (with B. Rostami, F. Malucelli, and D. Frey)


• Min-max-min Robustness: a New Approach to Combinatorial Optimization under Uncertainty Based on Multiple Solutions.
  International Network Optimization Conference – INOC 2015, Electronic Notes in Discrete Mathematics 52, pp 45–52 (2016)
  (with J. Kurtz)


• Lower Bounding Procedures for the Single Allocation Hub Location Problem.
  International Network Optimization Conference – INOC 2015, Electronic Notes in Discrete Mathematics 52, pp 69–76 (2016)
  (with B. Rostami, J. F. Meier, and U. Clausen)


• A Compact Linearisation of Euclidean Single Allocation Hub Location Problems.
  International Network Optimization Conference – INOC 2015, Electronic Notes in Discrete Mathematics 52, pp 37–44 (2016)
  (with J. F. Meier, U. Clausen, and B. Rostami)


• Lagrangean Decomposition for Mean-Variance Combinatorial Optimization.
  International Symposium on Combinatorial Optimization – ISCO 2014, LNCS 8596, pp 62–74 (2014)
  (with F. Baumann and A. Ilyina)


• Active Set Methods with Reoptimization for Convex Quadratic Integer Programming.
  International Symposium on Combinatorial Optimization – ISCO 2014, LNCS 8596, pp 125–136 (2014)
  (with L. Trieu)


• Box-Constrained Mixed-Integer Polynomial Optimization Using Separable Underestimators.
  Integer Programming and Combinatorial Optimization – IPCO 2014, LNCS 8494, pp 198–209 (2014)
  (with C. D'Ambrosio)


• Automated compensation of form errors: On neighborhood structures for the isometric registration of scanned surface data.
  International Conference on Engineering and Applied Sciences Optimization -- OPT-i 2014, pp 579–589 (2014)
  (with E. Kuthe, L. Klein, T. Wagner, and D. Biermann)


• The Spanning Tree Problem with One Quadratic Term.
  12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization – CTW 2013, pp 31–34 (2013)
  (with L. Klein)


• A Column Generation Approach for Strategic Planning in LTL Logistics.
  VeRoLog 2013 (2013)
  (with F. Meier, F. Baumann, and U. Clausen)


• Quadratic Outer Approximation for Convex Integer Programming.
  12th International Symposium on Experimental Algorithms – SEA 2013, LNCS 7933, pp 224–235 (2013)
  (with L. Trieu)


• Separable Non-convex Underestimators for Binary Quadratic Programming.
  12th International Symposium on Experimental Algorithms – SEA 2013, LNCS 7933, pp 236–247 (2013)
  (with E. Traversi)


• Quadratic Models for Hub-Location Problems Revisited
  VeRoLog 2012 (2012)
  (with J. Baudach, F. Baumann, U. Clausen, and F. Meier)


• An Exact Algorithm for Robust Network Design
  International Network Optimization Conference – INOC 2011, LNCS 6701, pp 7–17 (2011)
  (with F. Liers and L. Sanità)


• Practical Solution of Periodic Filtered Approximation as a Convex Quadratic Integer Program
  Complex Systems Design & Management (CSDM) 2010, pp 149–160 (2010)
  (with F. Bizzarri, S. Callegari, A. Caprara, A. Lodi, R. Rovatti, and G. Setti)


• Exact Bipartite Crossing Minimization under Tree Constraints
  9th International Symposium on Experimental Algorithms – SEA 2010, LNCS 6049, pp 118–128 (2010)
  (with F. Baumann and F. Liers)


• Submodular Formulations for Range Assignment Problems
  International Symposium on Combinatorial Optimization – ISCO 2010, Electronic Notes in Discrete Mathematics 36, pp 239–246 (2010)
  (with F. Baumann)


• An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
  Integer Programming and Combinatorial Optimization – IPCO 2010, LNCS 6080, pp 285–298 (2010)
  (with A. Caprara and A. Lodi)


• A Basic Toolbox for Constrained Quadratic 0/1 Optimization
  WEA 2008: Workshop on Experimental Algorithms, LNCS 5038, pp 249–262 (2008)
  (with F. Liers and M. Oswald)


• A New Exact Algorithm for the Two-Sided Crossing Minimization Problem
  Combinatorial Optimization and Applications – COCOA 2007, LNCS 4616, pp 301–310 (2007)
  (with L. Zheng)


• Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
  Computing and Combinatorics – COCOON 2006, LNCS 4112, pp 507–516 (2006)
  (with L. Zheng)


• Bimodal Crossing Minimization
  Computing and Combinatorics – COCOON 2006, LNCS 4112, pp 497–506 (2006)
  (with M. Jünger, A. Menze, and M. Percan)


• Exact Crossing Minimization
  Graph Drawing 2005, LNCS 3843, pp 37–48 (2006)
  (with D. Ebner, M. Jünger, G. W. Klau, P. Mutzel, and R. Weiskircher)


• An Integer Programming Approach to Fuzzy Symmetry Detection
  Graph Drawing 2003, LNCS 2912, pp 166–177 (2004)
  (with M. Jünger)


• Improving Walker's Algorithm to Run in Linear Time
  Graph Drawing 2002, LNCS 2528, pp 344–353 (2002)
  (with M. Jünger and S. Leipert)


• Crossing Minimization for Symmetries
  ISAAC 2002, LNCS 2518, pp 563–574 (2002)
  (with S. Hong)


• Detecting Symmetries by Branch & Cut
  Graph Drawing 2001, LNCS 2265, pp 178–188 (2002)
  (with M. Jünger)


• A Fast Layout Algorithm for k-Level Graphs
  Graph Drawing 2000, LNCS 1984, pp 229–240 (2000)
  (with M. Jünger and S. Leipert)