The following pages link to Gerhard Reinelt (Q403651):
Displaying 50 items.
- (Q196670) (redirect page) (← links)
- Lifting and separation procedures for the cut polytope (Q403653) (← links)
- A branch-and-bound algorithm for the coupled task problem (Q406642) (← links)
- A benchmark library and a comparison of heuristic methods for the linear ordering problem (Q429522) (← links)
- On a binary distance model for the minimum linear arrangement problem (Q458974) (← links)
- A branch and cut solver for the maximum stable set problem (Q491210) (← links)
- On a class of metrics related to graph layout problems (Q603106) (← links)
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization. (Q612873) (← links)
- BoxStep methods for crew pairing problems (Q833409) (← links)
- Applying mod-\(k\)-cuts for solving linear ordering problems (Q839896) (← links)
- On the graphical relaxation of the symmetric traveling salesman polytope (Q877195) (← links)
- PANDA: a software for polyhedral transformations (Q904954) (← links)
- Improved analysis of an algorithm for the coupled task problem with UET jobs (Q1015304) (← links)
- Direct methods with maximal lower bound for mixed-integer optimal control problems (Q1016114) (← links)
- The simultaneous consecutive ones problem (Q1019172) (← 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)
- Quadratic \(0/1\) optimization and a decomposition approach for the placement of electronic circuits (Q1327559) (← links)
- The traveling salesman. Computational solutions for RSP applications (Q1338450) (← links)
- The weighted consecutive ones problem for a fixed number of rows or columns. (Q1400344) (← links)
- A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints (Q1588841) (← links)
- A mixed integer linear programming model for multi-satellite scheduling (Q1713768) (← links)
- Optimal linear arrangements using betweenness variables (Q1762457) (← links)
- An exact algorithm for scheduling identical coupled tasks (Q1762669) (← links)
- Combinatorial optimization and small polytopes (Q1814809) (← links)
- Exact solution of the 2-dimensional grid arrangement problem (Q1926499) (← links)
- Exact ground states of two-dimensional \(\pm J\) Ising spin glasses (Q1946872) (← links)
- Generating partitions of a graph into a fixed number of minimum weight cuts (Q1952501) (← links)
- Exact and heuristic methods in combinatorial optimization. A study on the linear ordering and the maximum diversity problem (Q2122552) (← links)
- A note on small linear-ordering polytopes (Q2368130) (← links)
- New results on the windy postman problem (Q2429464) (← links)
- On-line bin packing with restricted repacking (Q2436663) (← links)
- On the general routing polytope (Q2473035) (← links)
- Computing finest mincut partitions of a graph and application to routing problems (Q2473036) (← links)
- A note on the undirected rural postman problem polytope (Q2492671) (← links)
- A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem (Q2496041) (← links)
- Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm (Q2500052) (← links)
- Evaluating the quality of image matrices in blockmodeling (Q2516355) (← links)
- Traces of the XII Aussois Workshop on combinatorial optimization (Q2638379) (← links)
- (Q2712305) (← links)
- (Q2766846) (← links)
- A Heuristic for an Earth Observing Satellite Constellation Scheduling Problem with Download Considerations (Q2883640) (← links)
- Maximally Violated Mod-<i>p</i> Cuts for the Capacitated Vehicle-Routing Problem (Q2892303) (← links)
- (Q2909025) (← links)
- The Lagrangian relaxation for the combinatorial integral approximation problem (Q2943809) (← links)
- Via Minimization with Pin Preassignments and Layer Preference (Q3197850) (← links)
- A Cutting Plane Algorithm for the Linear Ordering Problem (Q3217947) (← links)
- (Q3416579) (← links)
- Computing Best Transition Pathways in High-Dimensional Dynamical Systems: Application to the <i>Alpha<sub>L</sub></i> \leftrightharpoons <i>Beta</i> \leftrightharpoons <i>Alpha<sub>R</sub></i> Transitions in Octaalanine (Q3446796) (← links)
