default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristoph Buchheim
Person information
- affiliation: Technical University of Dortmund, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j59]Christoph Buchheim
, Alexandra Grütering, Christian Meyer:
Parabolic optimal control problems with combinatorial switching constraints, part III: branch-and-bound algorithm. Comput. Optim. Appl. 90(3): 649-689 (2025)- [j58]Christoph Buchheim:
Extended formulations for binary optimal control problems. Math. Program. 213(1): 1039-1062 (2025) - 2024
- [j57]Enrico Bettiol, Christoph Buchheim, Marianna De Santis, Francesco Rinaldi:
An oracle-based framework for robust combinatorial optimization. J. Glob. Optim. 88(1): 27-51 (2024) - [j56]Christoph Buchheim, Alexandra Grütering, Christian Meyer:
Parabolic Optimal Control Problems with Combinatorial Switching Constraints, Part I: Convex Relaxations. SIAM J. Optim. 34(2): 1187-1205 (2024) - [j55]Christoph Buchheim, Alexandra Grütering, Christian Meyer:
Parabolic Optimal Control Problems with Combinatorial Switching Constraints, Part II: Outer Approximation Algorithm. SIAM J. Optim. 34(2): 1295-1315 (2024) - 2023
- [j54]Christoph Buchheim, Maja Hügging:
The polytope of binary sequences with bounded variation. Discret. Optim. 48(Part 1): 100776 (2023) - [j53]Christoph Buchheim:
Bilevel linear optimization belongs to NP and admits polynomial-size KKT-based reformulations. Oper. Res. Lett. 51(6): 618-622 (2023) - 2022
- [j52]Federica Bomboi, Christoph Buchheim, Jonas Pruente:
On the stochastic vehicle routing problem with time windows, correlated travel times, and time dependency. 4OR 20(2): 217-239 (2022) - [j51]Christoph Buchheim, Dorothee Henke:
The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective. J. Glob. Optim. 83(4): 803-824 (2022) - [j50]Christoph Buchheim, Dorothee Henke, Jannik Irmai:
The Stochastic Bilevel Continuous Knapsack Problem with Uncertain Follower's Objective. J. Optim. Theory Appl. 194(2): 521-542 (2022) - [j49]Christoph Buchheim, Dorothee Henke, Felix Hommelsheim:
On the complexity of the bilevel minimum spanning tree problem. Networks 80(3): 338-355 (2022) - [j48]Christoph Buchheim, Emiliano Traversi:
Convex optimization under combinatorial sparsity constraints. Oper. Res. Lett. 50(6): 632-638 (2022) - [c26]Christoph Buchheim, Maja Hügging:
Bounded Variation in Binary Sequences. ISCO 2022: 64-75 - [i7]Luce Brotcorne, Christoph Buchheim, Dick den Hertog, Dorothee Henke:
Optimization at the Second Level (Dagstuhl Seminar 22441). Dagstuhl Reports 12(10): 207-224 (2022) - 2021
- [j47]Borzou Rostami, Nicolas Kämmerling, Joe Naoum-Sawaya, Christoph Buchheim, Uwe Clausen:
Stochastic single-allocation hub location. Eur. J. Oper. Res. 289(3): 1087-1106 (2021) - [j46]Christoph Buchheim, Marcia Fampa, Orlando Sarmiento:
Lower Bounds for Cubic Optimization over the Sphere. J. Optim. Theory Appl. 188(3): 823-846 (2021) - [j45]Christoph Buchheim, Dorothee Henke, Felix Hommelsheim:
On the complexity of robust bilevel optimization with uncertain follower's objective. Oper. Res. Lett. 49(5): 703-707 (2021) - [i6]Christoph Buchheim, Dorothee Henke, Felix Hommelsheim:
On the Complexity of Robust Bilevel Optimization With Uncertain Follower's Objective. CoRR abs/2105.08378 (2021) - [i5]Christoph Buchheim, Dorothee Henke, Jannik Irmai:
The stochastic bilevel continuous knapsack problem with uncertain follower's objective. CoRR abs/2108.12303 (2021) - 2020
- [j44]Christoph Buchheim:
A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization. Discret. Appl. Math. 285: 591-593 (2020) - [j43]Lars Eufinger, Jannis Kurtz, Christoph Buchheim, Uwe Clausen:
A Robust Approach to the Capacitated Vehicle Routing Problem with Uncertain Costs. INFORMS J. Optim. 2(2): 79-95 (2020) - [i4]Christoph Buchheim, Dorothee Henke, Felix Hommelsheim:
On the Complexity of the Bilevel Minimum Spanning Tree Problem. CoRR abs/2012.12770 (2020)
2010 – 2019
- 2019
- [j42]Christoph Buchheim, Yves Crama, Elisabeth Rodríguez-Heck:
Berge-acyclic multilinear 0-1 optimization problems. Eur. J. Oper. Res. 273(1): 102-107 (2019) - [j41]Christoph Buchheim, Jonas Pruente:
K-adaptability in stochastic combinatorial optimization under objective uncertainty. Eur. J. Oper. Res. 277(3): 953-963 (2019) - [j40]Christoph Buchheim, Maribel Montenegro, Angelika Wiegele:
SDP-based branch-and-bound for non-convex quadratic integer optimization. J. Glob. Optim. 73(3): 485-514 (2019) - [j39]Christoph Buchheim, Marianna De Santis:
An active set algorithm for robust combinatorial optimization based on separation oracles. Math. Program. Comput. 11(4): 755-789 (2019) - [c25]Christoph Buchheim, Marcia Fampa, Orlando Sarmiento:
Tractable Relaxations for the Cubic One-Spherical Optimization Problem. WCGO 2019: 267-276 - [i3]Christoph Buchheim, Dorothee Henke:
The robust bilevel continuous knapsack problem. CoRR abs/1903.02810 (2019) - 2018
- [j38]Christoph Buchheim, Renke Kuhlmann, Christian Meyer:
Combinatorial optimal control of semilinear elliptic PDEs. Comput. Optim. Appl. 70(3): 641-675 (2018) - [j37]Borzou Rostami, Nicolas Kämmerling, Christoph Buchheim, Uwe Clausen:
Reliable single allocation hub location problem under hub breakdowns. Comput. Oper. Res. 96: 15-29 (2018) - [j36]Christoph Buchheim, Jannis Kurtz:
Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty. Discret. Optim. 28: 1-15 (2018) - [j35]Christoph Buchheim, Jannis Kurtz:
Robust combinatorial optimization under convex and discrete cost uncertainty. EURO J. Comput. Optim. 6(3): 211-238 (2018) - [j34]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): 473-485 (2018) - [j33]Christoph Buchheim, Emiliano Traversi:
Quadratic Combinatorial Optimization Using Separable Underestimators. INFORMS J. Comput. 30(3): 424-437 (2018) - [j32]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): 625-644 (2018) - 2017
- [j31]Christoph Buchheim, Claudia D'Ambrosio:
Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization. J. Glob. Optim. 67(4): 759-786 (2017) - [j30]Christoph Buchheim, Jannis Kurtz:
Min-max-min robust combinatorial optimization. Math. Program. 163(1-2): 1-23 (2017) - 2016
- [j29]J. Fabian Meier, Uwe Clausen, Borzou Rostami, Christoph Buchheim:
A Compact Linearisation of Euclidean Single Allocation Hub Location Problems. Electron. Notes Discret. Math. 52: 37-44 (2016) - [j28]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: 45-52 (2016) - [j27]Borzou Rostami, Christoph Buchheim, J. Fabian Meier, Uwe Clausen:
Lower Bounding Procedures for the Single Allocation Hub Location Problem. Electron. Notes Discret. Math. 52: 69-76 (2016) - [j26]Joe Naoum-Sawaya, Christoph Buchheim:
Robust Critical Node Selection by Benders Decomposition. INFORMS J. Comput. 28(1): 162-174 (2016) - [j25]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): 137-146 (2016) - [j24]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): 1695-1714 (2016) - [c24]Christoph Buchheim, Maribel Montenegro, Angelika Wiegele:
A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs. ISCO 2016: 110-122 - [c23]Borzou Rostami, Christopher Strothmann, Christoph Buchheim:
A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels. ISCO 2016: 237-248 - 2015
- [j23]Christoph Buchheim, Emiliano Traversi:
On the separation of split inequalities for non-convex quadratic integer programming. Discret. Optim. 15: 1-14 (2015) - [j22]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): 384-388 (2015) - [j21]Christoph Buchheim, Ruth Hübner, Anita Schöbel:
Ellipsoid Bounds for Convex Quadratic Integer Programming. SIAM J. Optim. 25(2): 741-769 (2015) - [c22]Borzou Rostami, Federico Malucelli, Davide Frey, Christoph Buchheim:
On the Quadratic Shortest Path Problem. SEA 2015: 379-390 - 2014
- [j20]Christoph Buchheim, Laura Klein:
Combinatorial optimization with one quadratic term: Spanning trees and forests. Discret. Appl. Math. 177: 34-52 (2014) - [j19]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): 81-89 (2014) - [c21]Christoph Buchheim, Claudia D'Ambrosio:
Box-Constrained Mixed-Integer Polynomial Optimization Using Separable Underestimators. IPCO 2014: 198-209 - [c20]Frank Baumann, Christoph Buchheim, Anna Ilyina:
Lagrangean Decomposition for Mean-Variance Combinatorial Optimization. ISCO 2014: 62-74 - [c19]Christoph Buchheim, Long Trieu:
Active Set Methods with Reoptimization for Convex Quadratic Integer Programming. ISCO 2014: 125-136 - 2013
- [j18]Christoph Buchheim, Angelika Wiegele:
Semidefinite relaxations for non-convex quadratic mixed-integer programming. Math. Program. 141(1-2): 435-452 (2013) - [j17]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): 1867-1889 (2013) - [c18]Christoph Buchheim, Long Trieu:
Quadratic Outer Approximation for Convex Integer Programming with Box Constraints. SEA 2013: 224-235 - [c17]Christoph Buchheim, Emiliano Traversi:
Separable Non-convex Underestimators for Binary Quadratic Programming. SEA 2013: 236-247 - [r1]Christoph Buchheim, Markus Chimani, Carsten Gutwenger, Michael Jünger, Petra Mutzel:
Crossings and Planarization. Handbook of Graph Drawing and Visualization 2013: 43-85 - [i2]Christoph Buchheim, Laura Klein:
The spanning tree problem with one quadratic term. CTW 2013: 31-34 - 2012
- [j16]Christoph Buchheim, Alberto Caprara, Andrea Lodi:
An effective branch-and-bound algorithm for convex quadratic integer programming. Math. Program. 135(1-2): 369-395 (2012) - 2011
- [c16]Christoph Buchheim, Frauke Liers, Laura Sanità:
An Exact Algorithm for Robust Network Design. INOC 2011: 7-17 - 2010
- [j15]Frank Baumann, Christoph Buchheim:
Submodular Formulations for Range Assignment Problems. Electron. Notes Discret. Math. 36: 239-246 (2010) - [j14]Christoph Buchheim, Angelika Wiegele, Lanbo Zheng:
Exact Algorithms for the Quadratic Linear Ordering Problem. INFORMS J. Comput. 22(1): 168-177 (2010) - [j13]Christoph Buchheim, Frauke Liers, Marcus Oswald:
Speeding up IP-based algorithms for constrained quadratic 0-1 optimization. Math. Program. 124(1-2): 513-535 (2010) - [j12]Christoph Buchheim, Dennis Michaels, Robert Weismantel:
Integer Programming Subject to Monomial Constraints. SIAM J. Optim. 20(6): 3297-3311 (2010) - [c15]Frank Baumann, Christoph Buchheim, Frauke Liers:
Exact Bipartite Crossing Minimization under Tree Constraints. CTW 2010: 17-20 - [c14]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: 149-160 - [c13]Christoph Buchheim, Alberto Caprara, Andrea Lodi:
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming. IPCO 2010: 285-298 - [c12]Frank Baumann, Christoph Buchheim, Frauke Liers:
Exact Bipartite Crossing Minimization under Tree Constraints. SEA 2010: 118-128
2000 – 2009
- 2009
- [j11]Christoph Buchheim, Peter J. Cameron, Taoyang Wu:
On the subgroup distance problem. Discret. Math. 309(4): 962-968 (2009) - [j10]Christoph Buchheim, Giovanni Rinaldi:
Terse Integer Linear Programs for Boolean Optimization. J. Satisf. Boolean Model. Comput. 6(1-3): 121-139 (2009) - 2008
- [j9]Christoph Buchheim, Seok-Hee Hong:
Testing Planarity of Geometric Automorphisms in Linear Time. Algorithmica 52(4): 448-465 (2008) - [j8]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): 373-388 (2008) - [j7]Christoph Buchheim, Frauke Liers, Marcus Oswald:
Local cuts revisited. Oper. Res. Lett. 36(4): 430-433 (2008) - [c11]Christoph Buchheim, Frauke Liers, Marcus Oswald:
A Basic Toolbox for Constrained Quadratic 0/1 Optimization. WEA 2008: 249-262 - 2007
- [j6]Christoph Buchheim, Giovanni Rinaldi:
Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case. SIAM J. Optim. 18(4): 1398-1413 (2007) - [c10]Lanbo Zheng, Christoph Buchheim:
A New Exact Algorithm for the Two-Sided Crossing Minimization Problem. COCOA 2007: 301-310 - 2006
- [j5]Christoph Buchheim, Michael Jünger, Sebastian Leipert:
Drawing rooted trees in linear time. Softw. Pract. Exp. 36(6): 651-665 (2006) - [c9]Christoph Buchheim, Michael Jünger, Annette Menze, Merijam Percan:
Bimodal Crossing Minimization. COCOON 2006: 497-506 - [c8]Christoph Buchheim, Lanbo Zheng:
Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem. COCOON 2006: 507-516 - [i1]Christoph Buchheim, Peter J. Cameron, Taoyang Wu:
On the Subgroup Distance Problem. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j4]Christoph Buchheim, Michael Jünger:
Linear optimization over permutation groups. Discret. Optim. 2(4): 308-319 (2005) - [j3]Christoph Buchheim, Seok-Hee Hong:
Crossing Minimization for Symmetries. Theory Comput. Syst. 38(3): 293-311 (2005) - [c7]Christoph Buchheim, Dietmar Ebner, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher:
Exact Crossing Minimization. GD 2005: 37-48 - 2004
- [j2]Thorsten Akkerman, Christoph Buchheim, Michael Jünger, Daniel Teske:
On the complexity of drawing trees nicely: corrigendum. Acta Informatica 40(8): 603-607 (2004) - 2003
- [b1]Christoph Buchheim:
An integer programming approach to exact and fuzzy symmetry detection. University of Cologne, Germany, 2003, pp. 1-81 - [j1]Christoph Buchheim, Michael Jünger:
Detecting symmetries by branch & cut. Math. Program. 98(1-3): 369-384 (2003) - [c6]Christoph Buchheim, Michael Jünger:
An Integer Programming Approach to Fuzzy Symmetry Detection. GD 2003: 166-177 - 2002
- [c5]Christoph Buchheim, Michael Jünger, Sebastian Leipert:
Improving Walker's Algorithm to Run in Linear Time. GD 2002: 344-353 - [c4]Christoph Buchheim, Seok-Hee Hong:
Crossing Minimization for Symmetries. ISAAC 2002: 563-574 - 2001
- [c3]Christoph Buchheim, Michael Jünger:
Detecting Symmetries by Branch & Cut. GD 2001: 178-188 - 2000
- [c2]Christoph Buchheim, Michael Jünger, Sebastian Leipert:
A Fast Layout Algorithm for k-Level Graphs. GD 2000: 229-240
1990 – 1999
- 1998
- [c1]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. GD 1998: 456-457
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-10-28 23:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
