On the method of interchanging networks for permutation problems

DOI10.1080/02331938608843179zbMath0626.90068OpenAlexW2102492641WikidataQ57634040 ScholiaQ57634040MaRDI QIDQ3030589

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

traveling salesmanextension principleset of all permutationsinterchanging networks

Mathematics Subject Classification ID

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

Cites Work

• Approximate Traveling Salesman Algorithms
• A new extension principle algorithm for the traveling salesman problem
• Unnamed Item
• Unnamed Item

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