The following pages link to Rainer E. Burkard (Q170644):
Displayed 50 items.
- The simple block iterative algorithm of an extended entropy model and its convergence (Q1299869) (← links)
- Nonsmooth optimization methods for parallel decomposition of multicommodity flow problems (Q1308671) (← links)
- Vehicle scheduling in two-cycle flexible manufacturing systems (Q1341395) (← links)
- Cut and patch Steiner trees for ladders (Q1356409) (← links)
- QAPLIB - a quadratic assignment problem library (Q1361076) (← links)
- Efficiently solvable special cases of hard combinatorial optimization problems (Q1365047) (← links)
- Hamiltonian cycles in circulant digraphs with two stripes (Q1377694) (← links)
- The quadratic assignment problem. Theory and algorithms (Q1377989) (← links)
- A linear algorithm for the pos/neg-weighted 1-median problem on a cactus (Q1387702) (← links)
- Heuristics for biquadratic assignment problems and their computational comparison (Q1388822) (← links)
- The inverse-parametric knapsack problem (Q1388831) (← links)
- A minimax assignment problem in treelike communication networks (Q1390338) (← links)
- Finding all essential terms of a characteristic maxpolynomial. (Q1408449) (← links)
- Weight reduction problems with certain bottleneck objectives. (Q1417504) (← links)
- Max algebra and the linear assignment problem (Q1424306) (← links)
- Location problems: From classical geometry to managerial decisions (Q1574132) (← links)
- 2-medians in trees with pos/neg weights (Q1582068) (← links)
- Nearest route problem (Q1584634) (← links)
- Heuristic and exact algorithms for the precedence-constrained knapsack problem (Q1586807) (← links)
- Incrementing bipartite digraph edge-connectivity (Q1592842) (← links)
- Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood (Q1805008) (← links)
- A transportation problem with a permuted demand vector (Q1806273) (← links)
- OR Utopia (Q1806727) (← links)
- On Latin squares and the facial structure of related polytopes (Q1820162) (← links)
- Optimal schedules for periodically recurring events (Q1820681) (← links)
- Approximation of convex curves with application to the bicriterial minimum cost flow problem (Q1825606) (← links)
- A heuristic for quadratic Boolean programs with applications to quadratic assignment problems (Q1838910) (← links)
- Combinatorial optimization. Polyhedra and efficiency (3 volumes) (Q1854113) (← links)
- Center problems with pos/neg weights on trees (Q1869485) (← links)
- A note on the robust 1-center problem on trees (Q1872013) (← links)
- Combinatorial Optimization. Polyhedra and efficiency. CD-ROM (Q1883342) (← links)
- Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs (Q1885275) (← links)
- Vehicle routing in an automated warehouse: Analysis and optimization (Q1897373) (← links)
- On the role of bottleneck Monge matrices in combinatorial optimization (Q1904608) (← links)
- Three-dimensional axial assignment problems with decomposable cost coefficients (Q1917264) (← links)
- Perspectives of Monge properties in optimization (Q1923588) (← links)
- Volume maximization and orthoconvex approximation of orthogons (Q1969296) (← links)
- Computational study of a column generation algorithm for bin packing and cutting stock problems (Q1970365) (← links)
- Time-slot assignment for TDMA-systems (Q2265947) (← links)
- Spectral decompositions and generalized inverse in a circularization network flow problem (Q2367797) (← links)
- The web proxy location problem in general tree of rings networks (Q2385469) (← links)
- Inverse median problems (Q2386211) (← links)
- Relaxation and decomposition methods for mixed integer nonlinear programming. (Q2386510) (← links)
- On the Euclidean TSP with a permuted van der Veen matrix (Q2390323) (← links)
- Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra (Q2390995) (← links)
- A dichotomy for minimum cost graph homomorphisms (Q2427539) (← links)
- Monge properties, discrete convexity and applications (Q2432877) (← links)
- An ant colony algorithm for the pos/neg weighted \(p\)-median problem (Q2461260) (← links)
- The \(p\)-maxian problem on a tree (Q2467473) (← links)
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization (Q2483018) (← links)