Extreme Hamiltonian lines

DOI10.2307/1970124zbMATH Open0078.16502OpenAlexW2317566604WikidataQ93262552 ScholiaQ93262552MaRDI QIDQ768985FDOQ768985

Authors 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

Cited in

(30)

• Efficiently solvable special cases of bottleneck travelling salesman problems
• The maximum travelling salesman problem on symmetric Demidenko matrices
• Extreme Hamiltonian Circuits. Resolution of the Convex-Odd Case
• Extreme Hamiltonian Circuits. Resolution of the Convex-Even Case
• Recognising permuted Demidenko matrices
• Spanning trees and shortest paths in Monge graphs
• A general approach to avoiding two by two submatrices
• The multi-stripe travelling salesman problem
• Extrema concerning polygons in space-time
• Traveling salesman games with the Monge property
• Monge matrices make maximization manageable
• A comment on consecutive-2-out-of-\(n\) systems
• Using well-solvable quadratic assignment problems for VLSI interconnect applications
• 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
• Optimal wire ordering and spacing in low power semiconductor design
• Subclasses of solvable problems from classes of combinatorial optimization problems
• A remark about A comment on consecutive-2-out-of-n systems
• Universal conditions for algebraic travelling salesman problems to be efficiently solvable
• Generalisations of the Gilmore-Gomory traveling salesman problem and the Gilmore-Gomory scheme: a survey
• Another well-solvable case of the QAP: maximizing the job completion time variance
• Perspectives of Monge properties in optimization
• The cone of Monge matrices: Extremal rays and applications
• Monge properties, discrete convexity and applications
• The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
• A Note On Kalmanson Matrices^∗
• The assignment problem with nearly Monge arrays and incompatible partner indices
• On the traveling salesman problem with a relaxed Monge matrix
• New special cases of the quadratic assignment problem with diagonally structured coefficient matrices
• Special cases of travelling salesman problems and heuristics

This page was built for publication: Extreme Hamiltonian lines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q768985)