Edgeconvex Circuits and the Traveling Salesman Problem
From MaRDI portal
Publication:4770418
DOI10.4153/CJM-1975-104-6zbMath0284.05117MaRDI QIDQ4770418
Publication date: 1975
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Inequalities and extremum problems involving convexity in convex geometry (52A40) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items
Circular Planar Electrical Networks, Split Systems, and Phylogenetic Networks ⋮ On the traveling salesman problem with a relaxed Monge matrix ⋮ Order distances and split systems ⋮ Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem ⋮ The three-dimensional matching problem in kalmanson matrices ⋮ Balancing profits and costs on trees ⋮ Perspectives of Monge properties in optimization ⋮ Sometimes travelling is easy: The master tour problem ⋮ The multi-stripe travelling salesman problem ⋮ A Note On Kalmanson Matrices∗ ⋮ The maximum travelling salesman problem on symmetric Demidenko matrices ⋮ Polynomially solvable cases of the bipartite traveling salesman problem ⋮ New special cases of the quadratic assignment problem with diagonally structured coefficient matrices ⋮ A New Tractable Case of the QAP with a Robinson Matrix ⋮ The neighbor-net algorithm ⋮ GENERALISATIONS OF THE GILMORE-GOMORY TRAVELING SALESMAN PROBLEM AND THE GILMORE-GOMORY SCHEME: A SURVEY ⋮ The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure ⋮ Universal conditions for algebraic travelling salesman problems to be efficiently solvable ⋮ The trouble with the second quantifier ⋮ A solvable case of the quadratic assignment problem ⋮ Traveling salesman games with the Monge property ⋮ Four-point conditions for the TSP: the complete complexity classification ⋮ New exponential neighbourhood for polynomially solvable TSPs ⋮ Special cases of the traveling salesman problem
