The following pages link to Rainer E. Burkard (Q170644):
Displaying 50 items.
- On the traveling salesman problem with a relaxed Monge matrix (Q293365) (← links)
- A linear time algorithm for inverse obnoxious center location problems on networks (Q301046) (← links)
- Polynomially solvable special cases of the quadratic bottleneck assignment problem (Q411238) (← links)
- Inverse \(p\)-median problems with variable edge lengths (Q532535) (← links)
- Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees (Q534329) (← links)
- Discrete optimization: an Austrian view (Q537581) (← links)
- (Q585690) (redirect page) (← links)
- Quadratic assignment problems (Q594767) (← links)
- Median problems with positive and negative weights on cycles and cacti (Q604872) (← links)
- Inverse median location problems with variable coordinates (Q623783) (← links)
- Erratum to: Constrained partitioning problems (Q689980) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- (Q750276) (redirect page) (← links)
- A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time (Q750277) (← links)
- (Q794923) (redirect page) (← links)
- A thermodynamically motivated simulation procedure for combinatorial optimization problems (Q794925) (← links)
- Eigenfunctions and optimal orbits (Q801132) (← links)
- Optimizing over the subtour polytope of the travelling salesman problem (Q803048) (← links)
- QAPLIB-A quadratic assignment problem library (Q807376) (← links)
- Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices (Q853797) (← links)
- A linear bound on the diameter of the transportation polytope (Q858109) (← links)
- The quickest path problem (Q912765) (← links)
- Admissible transformations and assignment problems (Q934173) (← links)
- Reverse 2-median problem on trees (Q943832) (← links)
- The inverse 1-median problem on a cycle (Q951097) (← links)
- Mingling: mixed-integer rounding with bounds (Q964180) (← links)
- The inverse Fermat-Weber problem (Q976390) (← links)
- On boundedness of (quasi-)convex integer optimization problems (Q999128) (← links)
- A polynomial method for the pos/neg weighted 3-median problem on a tree (Q1006548) (← links)
- Valid inequalities for mips and group polyhedra from approximate liftings (Q1016121) (← links)
- Combinatorial algorithms for data migration to minimize average completion time (Q1024212) (← links)
- Inverse 1-center location problems with edge length augmentation on trees (Q1044223) (← links)
- Probabilistic asymptotic properties of some combinatorial optimization problems (Q1067976) (← links)
- On equivalent knapsack problems (Q1082265) (← links)
- Combinatorial heuristic algorithms with FORTRAN (Q1094328) (← links)
- Layering strategies for creating exploitable structure in linear and integer programs (Q1117840) (← links)
- An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem (Q1124717) (← links)
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis (Q1141079) (← links)
- Efficiently solvable special cases of bottleneck travelling salesman problems (Q1179263) (← links)
- Lexicographic bottleneck problems (Q1180835) (← links)
- Reshipments and overshipments in transportation problems with minimax objective (Q1182137) (← links)
- Mathematical programs with a two-dimensional reverse convex constraint (Q1186268) (← links)
- Degeneracy graphs and simplex cycling (Q1189552) (← links)
- Linear programming duality: an introduction to oriented matroids (Q1189586) (← links)
- Algorithmus 25. Verfahren zur gemischt-ganzzahligen konvexen Optimierung (Q1217451) (← links)
- A note on Hamiltonian split graphs (Q1255969) (← links)
- A linear compound algorithm for uniform machine scheduling (Q1266304) (← links)
- A note on MULTIFIT scheduling for uniform machines (Q1272356) (← links)
- The travelling salesman problem on permuted Monge matrices (Q1288469) (← links)
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases (Q1290637) (← links)
