Generating subtour elimination constraints for the TSP from pure integer solutions

Published 2016 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Generating subtour elimination constraints for the TSP from pure integer solutions
Authors
Keywords
Traveling salesman problem, Subtour elimination constraint, ILP solver, Random Euclidean graph, 90C27
Journal
Central European Journal of Operations Research
Volume 25, Issue 1, Pages 231-260
Publisher
Springer Nature
Online
2016-02-17
DOI
10.1007/s10100-016-0437-8
References
View 1 related references

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.