Christoph Buchheim

ORCID

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 44

Top Venues

University of Cologne, Germany (PHD)

Education History

University of Cologne, Germany

PHD

Publications

Enrico Bettiol, Christoph Buchheim, Marianna De Santis, Francesco Rinaldi
An oracle-based framework for robust combinatorial optimization. J. Glob. Optim. 88 (1) (2024)
Christoph Buchheim, Maja Hügging
The polytope of binary sequences with bounded variation. Discret. Optim. 48 (Part 1) (2023)
Christoph Buchheim
Bilevel linear optimization belongs to NP and admits polynomial-size KKT-based reformulations. Oper. Res. Lett. 51 (6) (2023)
Federica Bomboi, Christoph Buchheim, Jonas Pruente
On the stochastic vehicle routing problem with time windows, correlated travel times, and time dependency. 4OR 20 (2) (2022)
Christoph Buchheim, Dorothee Henke, Jannik Irmai
The Stochastic Bilevel Continuous Knapsack Problem with Uncertain Follower's Objective. J. Optim. Theory Appl. 194 (2) (2022)
Luce Brotcorne, Christoph Buchheim, Dick den Hertog, Dorothee Henke
Optimization at the Second Level (Dagstuhl Seminar 22441). Dagstuhl Reports 12 (10) (2022)
Christoph Buchheim, Emiliano Traversi
Convex optimization under combinatorial sparsity constraints. Oper. Res. Lett. 50 (6) (2022)
Christoph Buchheim, Maja Hügging
Bounded Variation in Binary Sequences. ISCO (2022)
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim
On the complexity of the bilevel minimum spanning tree problem. Networks 80 (3) (2022)
Christoph Buchheim, Dorothee Henke
The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective. J. Glob. Optim. 83 (4) (2022)
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim
On the Complexity of Robust Bilevel Optimization With Uncertain Follower's Objective. CoRR (2021)
Christoph Buchheim, Dorothee Henke, Jannik Irmai
The stochastic bilevel continuous knapsack problem with uncertain follower's objective. CoRR (2021)
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim
On the complexity of robust bilevel optimization with uncertain follower's objective. Oper. Res. Lett. 49 (5) (2021)
Christoph Buchheim, Marcia Fampa, Orlando Sarmiento
Lower Bounds for Cubic Optimization over the Sphere. J. Optim. Theory Appl. 188 (3) (2021)
Borzou Rostami, Nicolas Kämmerling, Joe Naoum-Sawaya, Christoph Buchheim, Uwe Clausen
Stochastic single-allocation hub location. Eur. J. Oper. Res. 289 (3) (2021)
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim
On the Complexity of the Bilevel Minimum Spanning Tree Problem. CoRR (2020)
Christoph Buchheim
A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization. Discret. Appl. Math. 285 (2020)
Christoph Buchheim, Jonas Pruente
-adaptability in stochastic combinatorial optimization under objective uncertainty. Eur. J. Oper. Res. 277 (3) (2019)
Christoph Buchheim, Marianna De Santis
An active set algorithm for robust combinatorial optimization based on separation oracles. Math. Program. Comput. 11 (4) (2019)
Christoph Buchheim, Maribel Montenegro, Angelika Wiegele
SDP-based branch-and-bound for non-convex quadratic integer optimization. J. Glob. Optim. 73 (3) (2019)
Christoph Buchheim, Yves Crama, Elisabeth Rodríguez-Heck
Berge-acyclic multilinear 0-1 optimization problems. Eur. J. Oper. Res. 273 (1) (2019)
Christoph Buchheim, Dorothee Henke
The robust bilevel continuous knapsack problem. CoRR (2019)
Christoph Buchheim, Marcia Fampa, Orlando Sarmiento
Tractable Relaxations for the Cubic One-Spherical Optimization Problem. WCGO (2019)
Christoph Buchheim, Jannis Kurtz
Robust combinatorial optimization under convex and discrete cost uncertainty. EURO J. Comput. Optim. 6 (3) (2018)
Christoph Buchheim, Renke Kuhlmann, Christian Meyer
Combinatorial optimal control of semilinear elliptic PDEs. Comput. Optim. Appl. 70 (3) (2018)
Borzou Rostami, André B. Chassein, Michael Hopf, Davide Frey, Christoph Buchheim, Federico Malucelli, Marc Goerigk
The quadratic shortest path problem: complexity, approximability, and solution methods. Eur. J. Oper. Res. 268 (2) (2018)
Christoph Buchheim, Marianna De Santis, Francesco Rinaldi, Long Trieu
A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization. J. Glob. Optim. 70 (3) (2018)
Christoph Buchheim, Jannis Kurtz
Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty. Discret. Optim. 28 (2018)
Christoph Buchheim, Emiliano Traversi
Quadratic Combinatorial Optimization Using Separable Underestimators. INFORMS J. Comput. 30 (3) (2018)
Borzou Rostami, Nicolas Kämmerling, Christoph Buchheim, Uwe Clausen
Reliable single allocation hub location problem under hub breakdowns. Comput. Oper. Res. 96 (2018)
Christoph Buchheim, Jannis Kurtz
Min-max-min robust combinatorial optimization. Math. Program. 163 (1-2) (2017)
Christoph Buchheim, Claudia D'Ambrosio
Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization. J. Glob. Optim. 67 (4) (2017)
Borzou Rostami, Christoph Buchheim, J. Fabian Meier, Uwe Clausen
Lower Bounding Procedures for the Single Allocation Hub Location Problem. Electron. Notes Discret. Math. 52 (2016)
Matthias Schweinoch, Renke Schäfer, Alexei Sacharow, Dirk Biermann, Christoph Buchheim
A non-rigid registration method for the efficient analysis of shape deviations in production engineering applications. Prod. Eng. 10 (2) (2016)
Christoph Buchheim, Maribel Montenegro, Angelika Wiegele
A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs. ISCO (2016)
Joe Naoum-Sawaya, Christoph Buchheim
Robust Critical Node Selection by Benders Decomposition. INFORMS J. Comput. 28 (1) (2016)
Christoph Buchheim, Marianna De Santis, Stefano Lucidi, Francesco Rinaldi, Long Trieu
A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming. SIAM J. Optim. 26 (3) (2016)
Christoph Buchheim, Jannis Kurtz
Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions. Electron. Notes Discret. Math. 52 (2016)
Borzou Rostami, Christopher Strothmann, Christoph Buchheim
A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels. ISCO (2016)
J. Fabian Meier, Uwe Clausen, Borzou Rostami, Christoph Buchheim
A Compact Linearisation of Euclidean Single Allocation Hub Location Problems. Electron. Notes Discret. Math. 52 (2016)
Borzou Rostami, Federico Malucelli, Davide Frey, Christoph Buchheim
On the Quadratic Shortest Path Problem. SEA (2015)
Christoph Buchheim, Emiliano Traversi
On the separation of split inequalities for non-convex quadratic integer programming. Discret. Optim. 15 (2015)
Christoph Buchheim, Ruth Hübner, Anita Schöbel
Ellipsoid Bounds for Convex Quadratic Integer Programming. SIAM J. Optim. 25 (2) (2015)
Christoph Buchheim, Marianna De Santis, Laura Palagi
A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations. Oper. Res. Lett. 43 (4) (2015)
Frank Baumann, Christoph Buchheim, Anna Ilyina
Lagrangean Decomposition for Mean-Variance Combinatorial Optimization. ISCO (2014)
Christoph Buchheim, Claudia D'Ambrosio
Box-Constrained Mixed-Integer Polynomial Optimization Using Separable Underestimators. IPCO (2014)
Laura Klein, Tobias Wagner, Christoph Buchheim, Dirk Biermann
A procedure for the evaluation and compensation of form errors by means of global isometric registration with subsequent local reoptimization. Prod. Eng. 8 (1-2) (2014)
Christoph Buchheim, Laura Klein
Combinatorial optimization with one quadratic term: Spanning trees and forests. Discret. Appl. Math. 177 (2014)
Christoph Buchheim, Long Trieu
Active Set Methods with Reoptimization for Convex Quadratic Integer Programming. ISCO (2014)
Christoph Buchheim, Laura Klein
The spanning tree problem with one quadratic term. CTW (2013)
Christoph Buchheim, Emiliano Traversi
Separable Non-convex Underestimators for Binary Quadratic Programming. SEA (2013)
Christoph Buchheim, Long Trieu
Quadratic Outer Approximation for Convex Integer Programming with Box Constraints. SEA (2013)
Christoph Buchheim, Marianna De Santis, Laura Palagi, Mauro Piacentini
An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations. SIAM J. Optim. 23 (3) (2013)
Christoph Buchheim, Angelika Wiegele
Semidefinite relaxations for non-convex quadratic mixed-integer programming. Math. Program. 141 (1-2) (2013)
Christoph Buchheim, Alberto Caprara, Andrea Lodi
An effective branch-and-bound algorithm for convex quadratic integer programming. Math. Program. 135 (1-2) (2012)
Christoph Buchheim, Frauke Liers, Laura Sanità
An Exact Algorithm for Robust Network Design. INOC (2011)
Federico Bizzarri, Christoph Buchheim, Sergio Callegari, Alberto Caprara, Andrea Lodi, Riccardo Rovatti, Gianluca Setti
Practical Solution of Periodic Filtered Approximation as a Convex Quadratic Integer Program. CSDM (2010)
Frank Baumann, Christoph Buchheim, Frauke Liers
Exact Bipartite Crossing Minimization under Tree Constraints. CTW (2010)
Christoph Buchheim, Angelika Wiegele, Lanbo Zheng
Exact Algorithms for the Quadratic Linear Ordering Problem. INFORMS J. Comput. 22 (1) (2010)
Frank Baumann, Christoph Buchheim, Frauke Liers
Exact Bipartite Crossing Minimization under Tree Constraints. SEA (2010)
Christoph Buchheim, Frauke Liers, Marcus Oswald
Speeding up IP-based algorithms for constrained quadratic 0-1 optimization. Math. Program. 124 (1-2) (2010)
Frank Baumann, Christoph Buchheim
Submodular Formulations for Range Assignment Problems. Electron. Notes Discret. Math. 36 (2010)
Christoph Buchheim, Alberto Caprara, Andrea Lodi
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming. IPCO (2010)
Christoph Buchheim, Dennis Michaels, Robert Weismantel
Integer Programming Subject to Monomial Constraints. SIAM J. Optim. 20 (6) (2010)
Christoph Buchheim, Giovanni Rinaldi
Terse Integer Linear Programs for Boolean Optimization. J. Satisf. Boolean Model. Comput. 6 (1-3) (2009)
Christoph Buchheim, Peter J. Cameron, Taoyang Wu
On the subgroup distance problem. Discret. Math. 309 (4) (2009)
Christoph Buchheim, Seok-Hee Hong
Testing Planarity of Geometric Automorphisms in Linear Time. Algorithmica 52 (4) (2008)
Christoph Buchheim, Frauke Liers, Marcus Oswald
A Basic Toolbox for Constrained Quadratic 0/1 Optimization. WEA (2008)
Christoph Buchheim, Frauke Liers, Marcus Oswald
Local cuts revisited. Oper. Res. Lett. 36 (4) (2008)
Christoph Buchheim, Markus Chimani, Dietmar Ebner, Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher
A branch-and-cut approach to the crossing number problem. Discret. Optim. 5 (2) (2008)
Lanbo Zheng, Christoph Buchheim
A New Exact Algorithm for the Two-Sided Crossing Minimization Problem. COCOA (2007)
Christoph Buchheim, Giovanni Rinaldi
Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case. SIAM J. Optim. 18 (4) (2007)
Christoph Buchheim, Michael Jünger, Sebastian Leipert
Drawing rooted trees in linear time. Softw. Pract. Exp. 36 (6) (2006)
Christoph Buchheim, Lanbo Zheng
Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem. COCOON (2006)
Christoph Buchheim, Peter J. Cameron, Taoyang Wu
On the Subgroup Distance Problem. Electron. Colloquium Comput. Complex. 13 (146) (2006)
Christoph Buchheim, Michael Jünger, Annette Menze, Merijam Percan
Bimodal Crossing Minimization. COCOON (2006)
Christoph Buchheim, Seok-Hee Hong
Crossing Minimization for Symmetries. Theory Comput. Syst. 38 (3) (2005)
Christoph Buchheim, Michael Jünger
Linear optimization over permutation groups. Discret. Optim. 2 (4) (2005)
Christoph Buchheim, Dietmar Ebner, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher
Exact Crossing Minimization. Graph Drawing (2005)
Thorsten Akkerman, Christoph Buchheim, Michael Jünger, Daniel Teske
On the complexity of drawing trees nicely: corrigendum. Acta Informatica 40 (8) (2004)
Christoph Buchheim, Michael Jünger
Detecting symmetries by branch & cut. Math. Program. 98 (1-3) (2003)
Christoph Buchheim, Michael Jünger
An Integer Programming Approach to Fuzzy Symmetry Detection. Graph Drawing (2003)
Christoph Buchheim, Michael Jünger, Sebastian Leipert
Improving Walker's Algorithm to Run in Linear Time. Graph Drawing (2002)
Christoph Buchheim, Seok-Hee Hong
Crossing Minimization for Symmetries. ISAAC (2002)
Christoph Buchheim, Michael Jünger
Detecting Symmetries by Branch & Cut. Graph Drawing (2001)
Christoph Buchheim, Michael Jünger, Sebastian Leipert
-Level Graphs. Graph Drawing (2000)
Petra Mutzel, Carsten Gutwenger, Ralf Brockenauer, Sergej Fialko, Gunnar W. Klau, Michael Krüger, Thomas Ziegler, Stefan Näher, David Alberts, Dirk Ambras, Gunter Koch, Michael Jünger, Christoph Buchheim, Sebastian Leipert
A Library of Algorithms for Graph Drawing. Graph Drawing (1998)

Christoph Buchheim.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Christoph Buchheim