Nonlinear resolving functions for the travelling salesman problem

DOI10.1134/S0005117913060088MaRDI QIDQ462011zbMATH OpenFDO

Authors S. Sergeev

Publication date 15 October 2014

Published in Automation and Remote Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Recommendations

• Algorithms for the minimax problem of the travelling salesman. II: Dual approach
• The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching
• Algorithms for solution of the travelling salesman problem. II: New lower bound
• New lower bounds for the symmetric travelling salesman problem
• scientific article; zbMATH DE number 4143778

Cites work

• scientific article; zbMATH DE number 3426330 (Why is no real title available?)
• scientific article; zbMATH DE number 818451 (Why is no real title available?)
• A restricted Lagrangean approach to the traveling salesman problem
• Computer algorithms for the solution of some linear and linear integer programming problems. I-IV
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching
• The traveling salesman problem and its variations
• The traveling salesman problem. I: Theoretical issues

Cited in

(3)

• Probabilistic prediction of the complexity of traveling salesman problems based on approximating the complexity distribution from experimental data
• Approximate algorithms for the traveling salesman problem. II
• Maximum travelling salesman problem. I

This page was built for publication: Nonlinear resolving functions for the travelling salesman problem

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