The following pages link to Michael Jünger (Q193592):
Displaying 39 items.
- Single-commodity robust network design with finite and hose demand sets (Q291071) (← links)
- Lifting and separation procedures for the cut polytope (Q403653) (← links)
- A branch-and-cut approach to the crossing number problem (Q951113) (← links)
- Linear optimization over permutation groups (Q1019295) (← links)
- (Q1123805) (redirect page) (← links)
- Experiments in quadratic 0-1 programming (Q1123806) (← links)
- Computing correct Delaunay triangulations (Q1179540) (← links)
- A complete description of the traveling salesman polytope on 8 nodes (Q1186944) (← links)
- Introduction to ABACUS -- a branch-and-cut system (Q1271386) (← links)
- Quadratic \(0/1\) optimization and a decomposition approach for the placement of electronic circuits (Q1327559) (← links)
- The thickness of a minor-excluded class of graphs (Q1379835) (← links)
- On the two-connected planar spanning subgraph polytope (Q1382280) (← links)
- Minimizing breaks by maximizing cuts. (Q1400343) (← links)
- Detecting symmetries by branch and cut. (Q1424304) (← links)
- A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints (Q1588841) (← links)
- A flow formulation for horizontal coordinate assignment with prescribed width (Q1725752) (← links)
- An integer programming approach to optimal basic block instruction scheduling for single-issue processors (Q1751173) (← links)
- On the complexity of drawing trees nicely: Corrigendum (Q1889885) (← links)
- New primal and dual matching heuristics (Q1891231) (← links)
- Maximum planar subgraphs and nice embeddings: Practical layout tools (Q1920420) (← links)
- Exact ground states of two-dimensional \(\pm J\) Ising spin glasses (Q1946872) (← links)
- Practical performance of efficient minimum cut algorithms (Q1969951) (← links)
- Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm (Q2500052) (← links)
- Traces of the XII Aussois Workshop on combinatorial optimization (Q2638379) (← links)
- On the SQAP-Polytope (Q2706338) (← links)
- Crossing Minimization in Storyline Visualization (Q2961530) (← links)
- (Q3043715) (← links)
- (Q3043769) (← links)
- (Q3043780) (← links)
- Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut (Q3060753) (← links)
- Models and Algorithms for Robust Network Design with Several Traffic Scenarios (Q3167631) (← links)
- Via Minimization with Pin Preassignments and Layer Preference (Q3197850) (← links)
- A Cutting Plane Algorithm for the Linear Ordering Problem (Q3217947) (← links)
- (Q3221421) (← links)
- Simple and Efficient Bilayer Cross Counting (Q3378492) (← links)
- (Q5075808) (← links)
- Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization (Q5084606) (← links)
- A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width (Q5233133) (← links)
- Large-Graph Layout Algorithms at Work: An Experimental Study (Q5301419) (← links)
