A Note On Kalmanson Matrices∗

DOI10.1080/02331939708844313zbMath0885.90094OpenAlexW2036077155MaRDI QIDQ4342970

Vitaly M. Demidenko, Rüdiger Rudolf

Publication date: 24 June 1997

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939708844313

zbMATH Keywords

Kalmanson matricesadditive characterization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Combinatorial optimization (90C27) Paths and cycles (05C38)

Related Items (1)

The neighbor-net algorithm

Cites Work

• Extreme Hamiltonian lines
• Special cases of travelling salesman problems and heuristics
• Sometimes Travelling is Easy: The Master Tour Problem
• Edgeconvex Circuits and the Traveling Salesman Problem

This page was built for publication: A Note On Kalmanson Matrices^∗