The following pages link to Rainer E. Burkard (Q170644):
Displayed 48 items.
- (Q4187582) (← links)
- (Q4190137) (← links)
- (Q4191842) (← links)
- Travelling Salesman and Assignment Problems: A Survey (Q4196459) (← links)
- Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey (Q4210360) (← links)
- (Q4210638) (← links)
- (Q4233409) (← links)
- (Q4247462) (← links)
- (Q4274016) (← links)
- (Q4321551) (← links)
- (Q4363163) (← links)
- (Q4369631) (← links)
- (Q4382124) (← links)
- (Q4398378) (← links)
- Constrained Steiner trees in Halin graphs (Q4467896) (← links)
- (Q4492899) (← links)
- (Q4519262) (← links)
- Minimum-cost strong network orientation problems: Classification, complexity, and algorithms (Q4540090) (← links)
- (Q4547466) (← links)
- The quadratic assignment problem with a monotone anti-monge and a symmetric toeplitz matrix: Easy and hard cases (Q4645924) (← links)
- The travelling salesman and the PQ-tree (Q4645944) (← links)
- (Q4664818) (← links)
- (Q4667358) (← links)
- (Q4766805) (← links)
- (Q4767119) (← links)
- Zur methode der approximierenden optimiernng (Q4773516) (← links)
- (Q4795376) (← links)
- (Q4902799) (← links)
- Einführung in die Mathematische Optimierung (Q4907712) (← links)
- (Q4944302) (← links)
- A process scheduling problem arising from chemical production planning (Q4946703) (← links)
- (Q5187078) (← links)
- Modelling and Optimizing Batch Processes in the Chemical Industry (Q5434335) (← links)
- A linear time algorithm for the reverse 1‐median problem on a cycle (Q5487819) (← links)
- Untersuchungen zum Optimum-Mix Problem (Q5589750) (← links)
- (Q5610445) (← links)
- (Q5626423) (← links)
- (Q5648149) (← links)
- (Q5655412) (← links)
- Constrained partitioning problems (Q5896609) (← links)
- On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions (Q5925734) (← links)
- Finiteness result for the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions (Q5925735) (← links)
- Convergence of a simulated annealing algorithm for continuous global optimization. (Q5928424) (← links)
- On covering method for d.c. optimization. (Q5928427) (← links)
- Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave cost network flow problem in acyclic networks. (Q5929388) (← links)
- A new bound for the quadratic assignment problem based on convex quadratic programming (Q5930731) (← links)
- On the complexity of a class of combinatorial optimization problems with uncertainty (Q5935709) (← links)
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut (Q5943078) (← links)