The following pages link to Christoph Buchheim (Q325379):
Displaying 50 items.
- A compact linearisation of Euclidean single allocation hub location problems (Q325380) (← links)
- Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions (Q325382) (← links)
- Lower bounding procedures for the single allocation hub location problem (Q325391) (← links)
- Semidefinite relaxations for non-convex quadratic mixed-integer programming (Q378112) (← links)
- Combinatorial optimization with one quadratic term: spanning trees and forests (Q406320) (← links)
- Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization (Q522270) (← links)
- Min-max-min robust combinatorial optimization (Q526823) (← links)
- Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
- An effective branch-and-bound algorithm for convex quadratic integer programming (Q715081) (← links)
- A branch-and-cut approach to the crossing number problem (Q951113) (← links)
- Local cuts revisited (Q1003489) (← links)
- On the subgroup distance problem. (Q1011736) (← links)
- Testing planarity of geometric automorphisms in linear time (Q1018045) (← links)
- Linear optimization over permutation groups (Q1019295) (← links)
- Detecting symmetries by branch and cut. (Q1424304) (← links)
- Réduction des tores déployés par une extension modérément ramifiée. (Reduction of tori split over tamely ramified extensions). (Q1426586) (← links)
- Reliable single allocation hub location problem under hub breakdowns (Q1652650) (← links)
- Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty (Q1662157) (← links)
- A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization (Q1704920) (← links)
- \(K\)-adaptability in stochastic combinatorial optimization under objective uncertainty (Q1740549) (← links)
- The quadratic shortest path problem: complexity, approximability, and solution methods (Q1754341) (← links)
- Crossing minimization for symmetries (Q1780845) (← links)
- A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations (Q1785386) (← links)
- On the complexity of drawing trees nicely: Corrigendum (Q1889885) (← links)
- Berge-acyclic multilinear 0-1 optimization problems (Q1991264) (← links)
- Stochastic single-allocation hub location (Q2029287) (← links)
- Lower bounds for cubic optimization over the sphere (Q2031942) (← links)
- On the complexity of robust bilevel optimization with uncertain follower's objective (Q2060358) (← links)
- Convex optimization under combinatorial sparsity constraints (Q2102824) (← links)
- On the stochastic vehicle routing problem with time windows, correlated travel times, and time dependency (Q2144215) (← links)
- The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective (Q2154452) (← links)
- The stochastic bilevel continuous knapsack problem with uncertain follower's objective (Q2156390) (← links)
- A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization (Q2197476) (← links)
- On the separation of split inequalities for non-convex quadratic integer programming (Q2339844) (← links)
- SDP-based branch-and-bound for non-convex quadratic integer optimization (Q2416574) (← links)
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization (Q2638389) (← links)
- Robust Critical Node Selection by Benders Decomposition (Q2806873) (← links)
- A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming (Q2817838) (← links)
- A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs (Q2835666) (← links)
- A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels (Q2835680) (← links)
- An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations (Q2866210) (← links)
- Submodular Formulations for Range Assignment Problems (Q2883570) (← links)
- Exact Algorithms for the Quadratic Linear Ordering Problem (Q2899047) (← links)
- Ellipsoid Bounds for Convex Quadratic Integer Programming (Q2954394) (← links)
- (Q3043715) (← links)
- Integer Programming Subject to Monomial Constraints (Q3083332) (← links)
- An Exact Algorithm for Robust Network Design (Q3091477) (← links)
- (Q3181648) (← links)
- Lagrangean Decomposition for Mean-Variance Combinatorial Optimization (Q3195317) (← links)
- Active Set Methods with Reoptimization for Convex Quadratic Integer Programming (Q3195322) (← links)
