Extreme Hamiltonian lines

DOI10.2307/1970124zbMath0078.16502OpenAlexW2317566604WikidataQ93262552 ScholiaQ93262552MaRDI QIDQ768985

Fred Supnick

Publication date: 1957

Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1970124

zbMATH Keywords

Topology

Related Items

A general approach to avoiding two by two submatrices ⋮ On the traveling salesman problem with a relaxed Monge matrix ⋮ Monge matrices make maximization manageable ⋮ Optimal wire ordering and spacing in low power semiconductor design ⋮ Special cases of travelling salesman problems and heuristics ⋮ Extreme Hamiltonian Circuits. Resolution of the Convex-Even Case ⋮ The assignment problem with nearly Monge arrays and incompatible partner indices ⋮ Spanning trees and shortest paths in Monge graphs ⋮ Perspectives of Monge properties in optimization ⋮ Using well-solvable quadratic assignment problems for VLSI interconnect applications ⋮ The cone of Monge matrices: Extremal rays and applications ⋮ The multi-stripe travelling salesman problem ⋮ Monge properties, discrete convexity and applications ⋮ A Note On Kalmanson Matrices^∗ ⋮ The maximum travelling salesman problem on symmetric Demidenko matrices ⋮ Efficiently solvable special cases of bottleneck travelling salesman problems ⋮ The quadratic assignment problem with a monotone anti-monge and a symmetric toeplitz matrix: Easy and hard cases ⋮ Extreme Hamiltonian Circuits. Resolution of the Convex-Odd Case ⋮ New special cases of the quadratic assignment problem with diagonally structured coefficient matrices ⋮ Another well-solvable case of the QAP: maximizing the job completion time variance ⋮ GENERALISATIONS OF THE GILMORE-GOMORY TRAVELING SALESMAN PROBLEM AND THE GILMORE-GOMORY SCHEME: A SURVEY ⋮ A comment on consecutive-2-out-of-\(n\) systems ⋮ Universal conditions for algebraic travelling salesman problems to be efficiently solvable ⋮ Traveling salesman games with the Monge property ⋮ Subclasses of solvable problems from classes of combinatorial optimization problems ⋮ The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases ⋮ Four-point conditions for the TSP: the complete complexity classification ⋮ Extrema concerning polygons in space-time ⋮ A remark about A comment on consecutive-2-out-of-n systems