Traveling salesman problem with backend information processing

DOI10.1016/J.ORL.2024.107193MaRDI QIDQ6988273zbMATH OpenFDO

Authors Merve Doganbas, Hayong Shin

Publication date 5 May 2025

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ORL.2024.107193

zbMATH Keywords

backend information processingMILPtraveling salesman

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)

Cites work

• A comparative analysis of several asymmetric traveling salesman problem formulations
• A comprehensive survey on the multiple traveling salesman problem: applications, approaches and taxonomy
• A Dynamic Programming Approach to Sequencing Problems
• A generalized insertion heuristic for the travelling salesman problem with time windows
• A method for solving traveling-salesman problems
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Cutting planes in integer and mixed integer programming
• Heuristics for the traveling salesman problem with pickup and delivery
• scientific article; zbMATH DE number 2064404 (Why is no real title available?)
• scientific article; zbMATH DE number 3005054 (Why is no real title available?)
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Integer Programming Formulation of Traveling Salesman Problems
• Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach

This page was built for publication: Traveling salesman problem with backend information processing

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