On common edges in optimal solutions to traveling salesman and other optimization problems

DOI10.1016/0166-218X(88)90057-1zbMath0648.90082MaRDI QIDQ1105496

S. H. Smith

Publication date: 1988

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

minimum spanning tree; complete graph; symmetric traveling salesman; common edges; minimum perfect matching

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C10: Integer programming

90C27: Combinatorial optimization

05C38: Paths and cycles

Related Items

Some graphic uses of an even number of odd nodes