Christoph Buchheim

According to our database1, Christoph Buchheim
  • authored at least 59 papers between 1998 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Min-max-min robust combinatorial optimization.
Math. Program., 2017

Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization.
J. Global Optimization, 2017

2016
A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming.
SIAM Journal on Optimization, 2016

A non-rigid registration method for the efficient analysis of shape deviations in production engineering applications.
Production Engineering, 2016

Robust Critical Node Selection by Benders Decomposition.
INFORMS Journal on Computing, 2016

Lower Bounding Procedures for the Single Allocation Hub Location Problem.
Electronic Notes in Discrete Mathematics, 2016

A Compact Linearisation of Euclidean Single Allocation Hub Location Problems.
Electronic Notes in Discrete Mathematics, 2016

Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions.
Electronic Notes in Discrete Mathematics, 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
Ellipsoid Bounds for Convex Quadratic Integer Programming.
SIAM Journal on Optimization, 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.
Discrete Optimization, 2015

On the Quadratic Shortest Path Problem.
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.
Production Engineering, 2014

Combinatorial optimization with one quadratic term: Spanning trees and forests.
Discrete Applied Mathematics, 2014

Active Set Methods with Reoptimization for Convex Quadratic Integer Programming.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

Lagrangean Decomposition for Mean-Variance Combinatorial Optimization.
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 Journal on Optimization, 2013

Semidefinite relaxations for non-convex quadratic mixed-integer programming.
Math. Program., 2013

Separable Non-convex Underestimators for Binary Quadratic Programming.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Quadratic Outer Approximation for Convex Integer Programming with Box Constraints.
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
An effective branch-and-bound algorithm for convex quadratic integer programming.
Math. Program., 2012

2011
An Exact Algorithm for Robust Network Design.
Proceedings of the Network Optimization - 5th International Conference, 2011

2010
Integer Programming Subject to Monomial Constraints.
SIAM Journal on Optimization, 2010

Speeding up IP-based algorithms for constrained quadratic 0-1 optimization.
Math. Program., 2010

Exact Algorithms for the Quadratic Linear Ordering Problem.
INFORMS Journal on Computing, 2010

Submodular Formulations for Range Assignment Problems.
Electronic Notes in Discrete Mathematics, 2010

Exact Bipartite Crossing Minimization under Tree Constraints.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming.
Proceedings of the Integer Programming and Combinatorial Optimization, 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
Terse Integer Linear Programs for Boolean Optimization.
JSAT, 2009

On the subgroup distance problem.
Discrete Mathematics, 2009

2008
Local cuts revisited.
Oper. Res. Lett., 2008

A branch-and-cut approach to the crossing number problem.
Discrete Optimization, 2008

Testing Planarity of Geometric Automorphisms in Linear Time.
Algorithmica, 2008

A Basic Toolbox for Constrained Quadratic 0/1 Optimization.
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

2007
Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case.
SIAM Journal on Optimization, 2007

A New Exact Algorithm for the Two-Sided Crossing Minimization Problem.
Proceedings of the Combinatorial Optimization and Applications, 2007

2006
Drawing rooted trees in linear time.
Softw., Pract. Exper., 2006

On the Subgroup Distance Problem.
Electronic Colloquium on Computational Complexity (ECCC), 2006

Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

Bimodal Crossing Minimization.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005
Crossing Minimization for Symmetries.
Theory Comput. Syst., 2005

Linear optimization over permutation groups.
Discrete Optimization, 2005

Exact Crossing Minimization.
Proceedings of the Graph Drawing, 13th International Symposium, 2005

2004
On the complexity of drawing trees nicely: corrigendum.
Acta Inf., 2004

2003
An integer programming approach to exact and fuzzy symmetry detection.
PhD thesis, 2003

Detecting symmetries by branch & cut.
Math. Program., 2003

An Integer Programming Approach to Fuzzy Symmetry Detection.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

2002
Crossing Minimization for Symmetries.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Improving Walker's Algorithm to Run in Linear Time.
Proceedings of the Graph Drawing, 10th International Symposium, 2002

2001
Detecting Symmetries by Branch & Cut.
Proceedings of the Graph Drawing, 9th International Symposium, 2001

2000
A Fast Layout Algorithm for k-Level Graphs.
Proceedings of the Graph Drawing, 8th International Symposium, 2000

1998
A Library of Algorithms for Graph Drawing.
Proceedings of the Graph Drawing, 6th International Symposium, 1998


  Loading...