| Publication | Date of Publication | Type |
|---|
| Maximum travelling salesman problem. I | 2015-11-17 | Paper |
| Approximate algorithms for the traveling salesman problem. II | 2015-09-30 | Paper |
| Nonlinear resolving functions for the travelling salesman problem | 2014-10-15 | Paper |
| The symmetric travelling salesman problem. II: New low bounds | 2010-09-24 | Paper |
| The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching | 2010-01-22 | Paper |
| Hybrid control systems and the dynamic traveling salesman problem | 2009-02-26 | Paper |
| New lower bounds for the triplanar assignment problem. Use of the classical model | 2009-02-26 | Paper |
| The three-dimensional assignment and partition problems. New lower bounds | 2007-10-23 | Paper |
| Discrete optimization by optimal control methods. I: Separable problems | 2007-10-23 | Paper |
| Discrete optimization by optimal control methods. II: The static traveling salesman problem | 2007-10-23 | Paper |
| Algorithms to solve some problems of concave programming with linear constraints | 2007-07-05 | Paper |
| Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem | 2007-06-14 | Paper |
| Improved lower bounds for the quadratic assignment problem | 2005-08-08 | Paper |
| Attainability sets of a class of multistep control processes: their design | 2005-06-17 | Paper |
| The quadratic assignment problem. I: New lower bounds in paired assignment | 2004-10-18 | Paper |
| Certain block problems of discrete optimization. II: Quasiblock problems | 2004-10-18 | Paper |
| Certain block problems of discrete optimization. I: A general approach to forming decomposition solution schemes | 2004-10-18 | Paper |
| The quadratic assignment problem. II: Refined Gilmore-Lawler algorithm | 2004-10-13 | Paper |
| Algorithms for the minimax problem of the travelling salesman. II: Dual approach | 1999-08-05 | Paper |
| Estimation of the duality gap for a discrete optimization problem | 1999-05-24 | Paper |
| Stability of separable discrete optimization problems | 1999-05-24 | Paper |
| Algorithms for the minimax problem of the traveling salesman. I: An approach based on dynamic programming | 1999-04-26 | Paper |
| Optimality conditions in discrete optimization problems | 1999-04-13 | Paper |
| Computational algorithms for the solution of the salesman problem. I: General pattern of classification | 1996-06-12 | Paper |
| Algorithms for solution of the travelling salesman problem. II: New lower bound | 1996-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4302087 | 1994-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4692680 | 1993-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4002409 | 1992-09-18 | Paper |
| Algorithms for solving a separable problem of discrete optimization | 1992-06-25 | Paper |
| Layout algorithm for computer-aided design of double-sided printed circuit boards | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3494382 | 1990-01-01 | Paper |
| The traveling salesman problem. Approximate algorithms | 1989-01-01 | Paper |
| The traveling salesman problem. I: Theoretical issues | 1989-01-01 | Paper |
| The traveling salesman problem. II: Exact methods | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3475126 | 1988-01-01 | Paper |
| A new lower bound for the quadratic assignment problem | 1987-01-01 | Paper |
| Flow in rotating radial channels at small Rossby and Ekman numbers | 1984-01-01 | Paper |
| Computer algorithms for the solution of some linear and linear integer programming problems. I-IV | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5327855 | 1964-01-01 | Paper |
