scientific article; zbMATH DE number 836777

MaRDI QIDQ4861868zbMATH OpenFDO

Authors Ray Deitch, Shaul P. Ladany

Publication date 23 January 1996

zbMATH Keywords

linear integer programmingoptimal tourist bus tours

Mathematics Subject Classification ID

Linear programming (90C05) Applications of mathematical programming (90C90) Integer programming (90C10) Transportation, logistics and supply chain management (90B06)

Recommendations

• A tour construction heuristic for the travelling salesman problem
• A tour extending hyper-heuristic algorithm for the traveling salesman problem
• An improved heuristic for the period traveling salesman problem
• An Effective Tour Construction and Improvement Procedure for the Traveling Salesman Problem
• Heuristics for the stochastic Eulerian tour problem
• Improved heuristics for the traveling purchaser problem.
• An Improved Approximation Algorithm for the Traveling Tournament Problem
• An improved approximation algorithm for the traveling tournament problem
• A new heuristic for the traveling salesman problem
• Improving a constructive heuristic for the general routing problem

Cited in

(6)

• A comparison of algorithms for finding an efficient theme park tour
• The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm
• On the tour planning problem
• A tour construction heuristic for the travelling salesman problem
• Improving TSP Tours Using Dynamic Programming over Tree Decompositions
• A mixed-integer linear programming approach to the optimization of event-bus schedules: a scheduling application in the tourism sector

This page was built for publication:

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