Optimality conditions to the acyclic travelling salesman problem.

DOI10.1007/BF03398656zbMath1278.90329OpenAlexW2775754494MaRDI QIDQ2467841

O. E. Charles-Owaba

Publication date: 29 January 2008

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03398656

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Uses Software

• TRAVEL

Cites Work

• Unnamed Item
• A modified Lin--Kernighan traveling-salesman heuristic
• Optimization of a 532-city symmetric traveling salesman problem by branch and cut
• Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
• Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
• A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
• Modelling setup times, process batches and transfer batches using activity network logic
• Genetic algorithms and traveling salesman problems
• Minimizing total completion time on a batch processing machine with job families
• An Algorithm for the Traveling Salesman Problem

This page was built for publication: Optimality conditions to the acyclic travelling salesman problem.