| Publication | Date of Publication | Type |
|---|
Remarks on the Newton method for solving nonlinear equality constrained optimization problems RAIRO - Operations Research | 1990-01-01 | Paper |
On duality for Boolean programming European Journal of Operational Research | 1990-01-01 | Paper |
On the numerical realization of the exact penalty method for quadratic programming algorithms European Journal of Operational Research | 1990-01-01 | Paper |
A note on dual solutions of the assignment problem in connection with the traveling salesman problem European Journal of Operational Research | 1990-01-01 | Paper |
Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem European Journal of Operational Research | 1989-01-01 | Paper |
A hybrid method for solving nonlinear knapsack problems European Journal of Operational Research | 1989-01-01 | Paper |
Remarks on second-order conditions in connection with the algorithm of Beale for quadratic programming European Journal of Operational Research | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4118167 (Why is no real title available?) | 1989-01-01 | Paper |
A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems BIT | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4057297 (Why is no real title available?) | 1988-01-01 | Paper |
Some remarks on two degrees of asymmetry in the traveling salesman problem RAIRO - Operations Research | 1988-01-01 | Paper |
A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm<sup>1</sup> Optimization | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4016607 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4039668 (Why is no real title available?) | 1987-01-01 | Paper |
On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem European Journal of Operational Research | 1986-01-01 | Paper |
Sharp bounds for Karp's “patching”-algorithm for the approximate solution of the traveling salesman problem Optimization | 1986-01-01 | Paper |
A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm Optimization | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4012317 (Why is no real title available?) | 1986-01-01 | Paper |
On the refinement of bounds of heuristic algorithms for the traveling salesman problem Mathematical Programming | 1985-01-01 | Paper |
Ein effektiver Branch and Bound-Algorithmus für Boolesche quadratische Optimierungsprobleme ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3956838 (Why is no real title available?) | 1985-01-01 | Paper |
Integer quadratic optimization European Journal of Operational Research | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3837784 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3868526 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3898615 (Why is no real title available?) | 1984-01-01 | Paper |
An efficient branch and bound algorithm to solve the quadratic integer programming problem Computing | 1983-01-01 | Paper |
Ein effektives simplexverfahren mit teiltableauwahl Mathematische Operationsforschung und Statistik. Series Optimization | 1983-01-01 | Paper |
Zur effektiven Lösung von booleschen, quadratischen Optimierungsproblemen Numerische Mathematik | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3753962 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3759929 (Why is no real title available?) | 1982-01-01 | Paper |
Untersuchungen über eine günstige verzweigungsreihenfolge der variablen bei branch and bound-verfahren Mathematische Operationsforschung und Statistik. Series Optimization | 1982-01-01 | Paper |
Zu verschärfungen der christofibes-schranke fü den wert einer optimalen tour des enndrelseproblems Mathematische Operationsforschung und Statistik. Series Optimization | 1982-01-01 | Paper |