Distance conserving reductions for nonoriented networks

DOI10.1007/BF01719842MaRDI QIDQ594774zbMATH OpenFDO

Authors Bernhard Fleischmann

Publication date 1983

Published in OR Spektrum (Search for Journal in Brave)

zbMATH Keywords

computational resultstravelling salesmanedge number reductionnonoriented network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites work

• scientific article; zbMATH DE number 3503127 (Why is no real title available?)
• scientific article; zbMATH DE number 3609444 (Why is no real title available?)
• A Dynamic Programming Approach to Sequencing Problems
• Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph
• Distance matrix of a graph and its realizability
• On the symmetric travelling salesman problem: Solution of a 120-city problem
• Solution of a Large-Scale Traveling-Salesman Problem
• Using cutting planes to solve the symmetric Travelling Salesman problem

Cited in

(4)

• A new class of cutting planes for the symmetric travelling salesman problem
• A cutting plane procedure for the travelling salesman problem on road networks
• A note on finding a shortest complete cycle in an undirected graph
• A note on computational aspects of the Steiner traveling salesman problem

This page was built for publication: Distance conserving reductions for nonoriented networks

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