S. Sergeev

From MaRDI portal
Person:462010

Available identifiers

zbMath Open sergeev.s-iMaRDI QIDQ462010

List of research outcomes





PublicationDate of PublicationType
Maximum travelling salesman problem. I2015-11-17Paper
Approximate algorithms for the traveling salesman problem. II2015-09-30Paper
Nonlinear resolving functions for the travelling salesman problem2014-10-15Paper
Eigenspace of a three-dimensional max-Łukasiewicz fuzzy matrix2012-09-04Paper
The symmetric travelling salesman problem. II: New low bounds2010-09-24Paper
The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching2010-01-22Paper
Hybrid control systems and the dynamic traveling salesman problem2009-02-26Paper
New lower bounds for the triplanar assignment problem. Use of the classical model2009-02-26Paper
Discrete optimization by optimal control methods. I: Separable problems2007-10-23Paper
The three-dimensional assignment and partition problems. New lower bounds2007-10-23Paper
Discrete optimization by optimal control methods. II: The static traveling salesman problem2007-10-23Paper
Algorithms to solve some problems of concave programming with linear constraints2007-07-05Paper
Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem2007-06-14Paper
Improved lower bounds for the quadratic assignment problem2005-08-08Paper
Attainability sets of a class of multistep control processes: their design2005-06-17Paper
The quadratic assignment problem. I: New lower bounds in paired assignment2004-10-18Paper
Certain block problems of discrete optimization. I: A general approach to forming decomposition solution schemes2004-10-18Paper
Certain block problems of discrete optimization. II: Quasiblock problems2004-10-18Paper
The quadratic assignment problem. II: Refined Gilmore-Lawler algorithm2004-10-13Paper
Algorithms for the minimax problem of the travelling salesman. II: Dual approach1999-08-05Paper
Estimation of the duality gap for a discrete optimization problem1999-05-24Paper
Stability of separable discrete optimization problems1999-05-24Paper
Algorithms for the minimax problem of the traveling salesman. I: An approach based on dynamic programming1999-04-26Paper
Optimality conditions in discrete optimization problems1999-04-13Paper
Computational algorithms for the solution of the salesman problem. I: General pattern of classification1996-06-12Paper
Algorithms for solution of the travelling salesman problem. II: New lower bound1996-06-09Paper
https://portal.mardi4nfdi.de/entity/Q43020871994-08-09Paper
https://portal.mardi4nfdi.de/entity/Q46926801993-06-05Paper
https://portal.mardi4nfdi.de/entity/Q40024091992-09-18Paper
Algorithms for solving a separable problem of discrete optimization1992-06-25Paper
Layout algorithm for computer-aided design of double-sided printed circuit boards1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34943821990-01-01Paper
The traveling salesman problem. I: Theoretical issues1989-01-01Paper
The traveling salesman problem. II: Exact methods1989-01-01Paper
The traveling salesman problem. Approximate algorithms1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34751261988-01-01Paper
A new lower bound for the quadratic assignment problem1987-01-01Paper
Flow in rotating radial channels at small Rossby and Ekman numbers1984-01-01Paper
Computer algorithms for the solution of some linear and linear integer programming problems. I-IV1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q53278551964-01-01Paper

Research outcomes over time

This page was built for person: S. Sergeev