Nonlinear resolving functions for the travelling salesman problem

DOI10.1134/S0005117913060088zbMATH Open1297.90142MaRDI QIDQ462011FDOQ462011

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)

Cites Work

• The traveling salesman problem and its variations
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling salesman problem. I: Theoretical issues
• Computer algorithms for the solution of some linear and linear integer programming problems. I-IV
• The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching
• A restricted Lagrangean approach to the traveling salesman problem
• Title not available (Why is that?)
• Title not available (Why is that?)

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)