{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/exact-approaches-for-the-travelling-thief","title":"Exact Approaches for the Travelling Thief Problem","arxiv_id":"1708.00331","date":"2017-08-01","proceeding":null,"authors":["Junhua Wu","Markus Wagner","Sergey Polyakovskiy","Frank Neumann"],"abstract":"Many evolutionary and constructive heuristic approaches have been introduced\nin order to solve the Traveling Thief Problem (TTP). However, the accuracy of\nsuch approaches is unknown due to their inability to find global optima. In\nthis paper, we propose three exact algorithms and a hybrid approach to the TTP.\nWe compare these with state-of-the-art approaches to gather a comprehensive\noverview on the accuracy of heuristic methods for solving small TTP instances.","url_abs":"http://arxiv.org/abs/1708.00331v1","url_pdf":"http://arxiv.org/pdf/1708.00331v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"exact-approaches-for-the-travelling-thief","repo_url":"https://github.com/markuswagnergithub/seal2017ExactApproachesForTheTravellingThiefProblem","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}