F. Körner

发表

A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm 1

F. Körner, 1988 .

A new branching rule for the branch and bound algorithm for solving nonlinear integer programming problems

F. Körner, 1988 .

Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem

F. Körner, B. Jeromin, 1989 .

A note on dual solutions of the assignment problem in connection with the traveling salesman problem

F. Körner, B. Jeromin, 1990 .

On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem

Frank Körner, F. Körner, 1986 .

Remarks on the Newton method for solving nonlinear equality constrained optimization problems

F. Körner, 1990 .

On duality for Boolean programming

Frank Körner, F. Körner, 1990 .

An efficient branch and bound algorithm to solve the quadratic integer programming problem

F. Körner, F. Körner, 1983, Computing.

Integer quadratic optimization

Frank Körner, F. Körner, 1985 .

Some remarks on two degrees of asymmetry in the traveling Salesman problem

F. Körner, B. Jeromin, 1988 .

A hybrid method for solving nonlinear knapsack problems

Frank Körner, F. Körner, 1989 .