On some machine sequencing problems (II)
Remarks on addition processes of positive floating-point numbers
Algorithms 20-22. Fundamental set of cycles of a graph
Generalizations of the standard travelling salesman problem
Algorithm 36. Transitive closure of a graph
The calculation of α-sets of representatives
A solvable case of the set-partitioning problem
A bisection method for the traveling salesman problem
Applied graph theory. Application of graph theory to numerical methods
The author surveys the problems given in the title and their several generalizations. He considers both theoretical and algorithmic approaches. Some of his previous results are also included. He concludes the first part with an extensive bibliography of the subject. (MR0480181)
Computational complexity of problems of combinatorics and graph theory
From the introduction: "The present article does not pretend to be a complete survey of all or even of the most important algorithms in combinatorics and graph theory. The algorithms presented illustrate only general considerations involving the computational complexity of problems of combinatorics. It is assumed that the reader is acquainted with the fundamental algorithms of combinatorics and graph theory. The first part of the paper is an outline of basic computation models used in the analysis...
New solvable cases of m-machine and n-element sequencing problems
Computational experiments with some approximation algorithms for the travelling salesman problem
Hamiltonian cycles in skirted trees
On a machine sequencing problem (I)
Algorithms 62-64. Graph-theoretic algorithms for sparse matrix transformations
PROBLEMS
Page 1