Effective Algorithms for a Bounded Version of the Uncapacitated TPP
From MaRDI portal
Publication:5850941
DOI10.1007/978-3-540-92944-4_14zbMath1178.90059MaRDI QIDQ5850941
Renata Mansini, Barbara Tocchella
Publication date: 20 January 2010
Published in: Lecture Notes in Economics and Mathematical Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-92944-4_14
90C35: Programming involving graphs or networks
90C29: Multi-objective and goal programming
90B10: Deterministic network models in operations research
Related Items
Cites Work
- Unnamed Item
- A heuristic approach for the travelling purchaser problem
- Travelling purchaser problem
- A branch and bound algorithm for the traveling purchaser problem
- Improved solutions for the traveling purchaser problem.
- Approximate algorithms for the travelling purchaser problem
- Heuristics for the traveling purchaser problem
- The biobjective travelling purchaser problem
- Dynamic tabu search strategies for the traveling purchaser problem
- A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- Variable neighborhood search: Principles and applications