Christoph Buchheim
Orcid: 0000-0001-9974-404XAffiliations:
- Technical University of Dortmund, Germany
According to our database1,
Christoph Buchheim
authored at least 82 papers
between 1998 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
J. Glob. Optim., January, 2024
2023
Bilevel linear optimization belongs to NP and admits polynomial-size KKT-based reformulations.
Oper. Res. Lett., November, 2023
2022
Dagstuhl Reports, October, 2022
The Stochastic Bilevel Continuous Knapsack Problem with Uncertain Follower's Objective.
J. Optim. Theory Appl., 2022
The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective.
J. Glob. Optim., 2022
On the stochastic vehicle routing problem with time windows, correlated travel times, and time dependency.
4OR, 2022
Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022
2021
On the complexity of robust bilevel optimization with uncertain follower's objective.
Oper. Res. Lett., 2021
2020
INFORMS J. Optim., January, 2020
A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization.
Discret. Appl. Math., 2020
2019
An active set algorithm for robust combinatorial optimization based on separation oracles.
Math. Program. Comput., 2019
J. Glob. Optim., 2019
<i>K</i>-adaptability in stochastic combinatorial optimization under objective uncertainty.
Eur. J. Oper. Res., 2019
Proceedings of the Optimization of Complex Systems: Theory, 2019
2018
J. Glob. Optim., 2018
INFORMS J. Comput., 2018
The quadratic shortest path problem: complexity, approximability, and solution methods.
Eur. J. Oper. Res., 2018
EURO J. Comput. Optim., 2018
Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty.
Discret. Optim., 2018
Comput. Oper. Res., 2018
Comput. Optim. Appl., 2018
2017
Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization.
J. Glob. Optim., 2017
2016
A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming.
SIAM J. Optim., 2016
A non-rigid registration method for the efficient analysis of shape deviations in production engineering applications.
Prod. Eng., 2016
Electron. Notes Discret. Math., 2016
Electron. Notes Discret. Math., 2016
Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions.
Electron. Notes Discret. Math., 2016
A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016
A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016
2015
A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations.
Oper. Res. Lett., 2015
On the separation of split inequalities for non-convex quadratic integer programming.
Discret. Optim., 2015
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015
2014
A procedure for the evaluation and compensation of form errors by means of global isometric registration with subsequent local reoptimization.
Prod. Eng., 2014
Discret. Appl. Math., 2014
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014
Box-Constrained Mixed-Integer Polynomial Optimization Using Separable Underestimators.
Proceedings of the Integer Programming and Combinatorial Optimization, 2014
2013
Crossings and Planarization.
Proceedings of the Handbook on Graph Drawing and Visualization., 2013
An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations.
SIAM J. Optim., 2013
Math. Program., 2013
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013
The spanning tree problem with one quadratic term.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013
2012
Math. Program., 2012
2011
Proceedings of the Network Optimization - 5th International Conference, 2011
2010
Math. Program., 2010
Electron. Notes Discret. Math., 2010
Practical Solution of Periodic Filtered Approximation as a Convex Quadratic Integer Program.
Proceedings of the Complex Systems Design & Management, 2010
Exact Bipartite Crossing Minimization under Tree Constraints.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010
2009
J. Satisf. Boolean Model. Comput., 2009
2008
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008
2007
SIAM J. Optim., 2007
Proceedings of the Combinatorial Optimization and Applications, 2007
2006
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006
2005
Proceedings of the Graph Drawing, 13th International Symposium, 2005
2004
2003
PhD thesis, 2003
Proceedings of the Graph Drawing, 11th International Symposium, 2003
2002
Proceedings of the Graph Drawing, 10th International Symposium, 2002
2000
Proceedings of the Graph Drawing, 8th International Symposium, 2000
1998
Proceedings of the Graph Drawing, 6th International Symposium, 1998