On the method of interchanging networks for permutation problems

DOI10.1080/02331938608843179MaRDI QIDQ3030589zbMATH OpenOpenAlexWikidataFDO

Authors Frank Werner

Publication date 1986

Published in Optimization (Search for Journal in Brave)

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

zbMATH Keywords

extension principletraveling salesmaninterchanging networksset of all permutations

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Directed graphs (digraphs), tournaments (05C20) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Integer programming (90C10)

Recommendations

• Sequential algorithm for the solution of problems of combinatorial optimization on permutations
• scientific article; zbMATH DE number 4095215
• scientific article; zbMATH DE number 49116
• scientific article; zbMATH DE number 3882227
• scientific article; zbMATH DE number 894762

Cites work

• scientific article; zbMATH DE number 3542181 (Why is no real title available?)
• scientific article; zbMATH DE number 3342874 (Why is no real title available?)
• A new extension principle algorithm for the traveling salesman problem
• Approximate Traveling Salesman Algorithms

Cited in

(4)

• Interpolation between bases and the shuffle exchange network
• scientific article; zbMATH DE number 1500488 (Why is no real title available?)
• scientific article; zbMATH DE number 3860886 (Why is no real title available?)
• A rearrangement algorithm for switching networks composed of digital symmetrical matrices

This page was built for publication: On the method of interchanging networks for permutation problems

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