Solution of a traveling salesman problem in computer component design

DOI10.1007/BF01068764zbMATH Open0559.90058MaRDI QIDQ5184671

N. K. Timofeeva

Publication date: 1983

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

travelling salesmancomputer component design

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Integer programming (90C10) Production models (90B30) Theory of software (68N99)

Recommendations

• On the solution of traveling salesman problems 👍 👎
• Travelling salesman problem tools for microcomputers 👍 👎
• Solving the \(k\)-best traveling salesman problem 👍 👎
• Solution of a Large-Scale Traveling-Salesman Problem 👍 👎
• Solution of a Large-Scale Traveling-Salesman Problem 👍 👎
• A Method for Solving Traveling-Salesman Problems 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Solution of a traveling salesman problem in computer component design

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