Christoph Buchheim

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