×
Author ID: korner.frank Recent zbMATH articles by "Körner, Frank"
Published as: Körner, Frank; Koerner, Frank; Körner, F.; Koerner, F.
Documents Indexed: 32 Publications since 1982
Co-Authors: 3 Co-Authors with 11 Joint Publications
12 Co-Co-Authors

Publications by Year

Citations contained in zbMATH Open

22 Publications have been cited 57 times in 37 Documents Cited by Year
A tight bound for the Boolean quadratic optimization problem and its use in a branch and bound algorithm. Zbl 0658.90066
Körner, F.
10
1988
Zur effektiven Lösung von booleschen, quadratischen Optimierungsproblemen. Zbl 0493.90059
Koerner, Frank; Richter, Claus
8
1982
A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems. Zbl 0657.65082
Körner, Frank
7
1988
An efficient branch and bound algorithm to solve the quadratic integer programming problem. Zbl 0494.65035
Koerner, F.
6
1983
A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm. Zbl 0617.90067
Körner, F.
6
1986
A hybrid method for solving nonlinear knapsack problems. Zbl 0676.90047
Körner, Frank
6
1989
Integer quadratic optimization. Zbl 0553.90070
Körner, Frank
6
1985
Zu Verschaerfungen der Christofides-Schranke für den Wert einer optimalen Tour des Rundreiseproblems. Zbl 0505.90051
Jeromin, Bernd; Koerner, Frank
4
1982
On the degree of asymmetry in the travelling salesman problem. Zbl 0637.90096
Körner, F.
4
1987
On the refinement of bounds of heuristic algorithms for the traveling salesman problem. Zbl 0564.90040
Jeromin, Bernd; Körner, Frank
4
1985
On the numerical realization of the exact penalty method for quadratic programming algorithms. Zbl 0714.90080
Körner, Frank
3
1990
Untersuchungen über eine guenstige Verzweigungsreihenfolge der Variablen bei branch and bound-Verfahren. Zbl 0494.90054
Koerner, Frank
3
1982
On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem. Zbl 0595.90091
Körner, Frank
3
1986
Ein effektiver Branch and Bound-Algorithmus für Boolesche quadratische Optimierungsprobleme. Zbl 0576.65056
Körner, F.
3
1985
On duality for Boolean programming. Zbl 0713.90051
Körner, Frank
2
1990
A simultaneous method for checking second-order Kuhn-Tucker conditions for equality constrained nonlinear programming problems. Zbl 0647.90074
Körner, F.; Luderer, B.
2
1988
Remarks on second-order conditions in connection with the algorithm of Beale for quadratic programming. Zbl 0683.90058
Körner, Frank
2
1989
Untersuchungen über Veränderungen der dualen Variablen beim Assignment- Problem. Zbl 0483.90081
Jeromin, Bernd; Koerner, Frank
1
1982
A hybrid method for solving integer linear programming problems. Zbl 0623.90056
Jeromin, Bernd; Körner, Frank
1
1986
Linear transformations associated with the traveling salesman problem. Zbl 0594.90085
Körner, Frank
1
1985
Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem. Zbl 0671.90085
Jeromin, Bernd; Körner, Frank
1
1989
Sharp bounds for Karp’s ”patching”-algorithm for the approximate solution of the traveling salesman problem. Zbl 0596.90096
Jeromin, B.; Körner, F.
1
1986
On the numerical realization of the exact penalty method for quadratic programming algorithms. Zbl 0714.90080
Körner, Frank
3
1990
On duality for Boolean programming. Zbl 0713.90051
Körner, Frank
2
1990
A hybrid method for solving nonlinear knapsack problems. Zbl 0676.90047
Körner, Frank
6
1989
Remarks on second-order conditions in connection with the algorithm of Beale for quadratic programming. Zbl 0683.90058
Körner, Frank
2
1989
Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem. Zbl 0671.90085
Jeromin, Bernd; Körner, Frank
1
1989
A tight bound for the Boolean quadratic optimization problem and its use in a branch and bound algorithm. Zbl 0658.90066
Körner, F.
10
1988
A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems. Zbl 0657.65082
Körner, Frank
7
1988
A simultaneous method for checking second-order Kuhn-Tucker conditions for equality constrained nonlinear programming problems. Zbl 0647.90074
Körner, F.; Luderer, B.
2
1988
On the degree of asymmetry in the travelling salesman problem. Zbl 0637.90096
Körner, F.
4
1987
A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm. Zbl 0617.90067
Körner, F.
6
1986
On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem. Zbl 0595.90091
Körner, Frank
3
1986
A hybrid method for solving integer linear programming problems. Zbl 0623.90056
Jeromin, Bernd; Körner, Frank
1
1986
Sharp bounds for Karp’s ”patching”-algorithm for the approximate solution of the traveling salesman problem. Zbl 0596.90096
Jeromin, B.; Körner, F.
1
1986
Integer quadratic optimization. Zbl 0553.90070
Körner, Frank
6
1985
On the refinement of bounds of heuristic algorithms for the traveling salesman problem. Zbl 0564.90040
Jeromin, Bernd; Körner, Frank
4
1985
Ein effektiver Branch and Bound-Algorithmus für Boolesche quadratische Optimierungsprobleme. Zbl 0576.65056
Körner, F.
3
1985
Linear transformations associated with the traveling salesman problem. Zbl 0594.90085
Körner, Frank
1
1985
An efficient branch and bound algorithm to solve the quadratic integer programming problem. Zbl 0494.65035
Koerner, F.
6
1983
Zur effektiven Lösung von booleschen, quadratischen Optimierungsproblemen. Zbl 0493.90059
Koerner, Frank; Richter, Claus
8
1982
Zu Verschaerfungen der Christofides-Schranke für den Wert einer optimalen Tour des Rundreiseproblems. Zbl 0505.90051
Jeromin, Bernd; Koerner, Frank
4
1982
Untersuchungen über eine guenstige Verzweigungsreihenfolge der Variablen bei branch and bound-Verfahren. Zbl 0494.90054
Koerner, Frank
3
1982
Untersuchungen über Veränderungen der dualen Variablen beim Assignment- Problem. Zbl 0483.90081
Jeromin, Bernd; Koerner, Frank
1
1982

Citations by Year