scientific article; zbMATH DE number 5855014
From MaRDI portal
Publication:3077271
zbMATH Open1224.90142MaRDI QIDQ3077271FDOQ3077271
Authors: Zoltán Blázsik, Tamás Bartók, Balázs Imreh, Zoltán Kovács, Csanád Imreh 
Publication date: 22 February 2011
Title of this publication is not available (Why is that?)
Recommendations
- TSP heuristics: domination analysis and complexity
- scientific article; zbMATH DE number 91020
- On the refinement of bounds of heuristic algorithms for the traveling salesman problem
- Heuristics and bounds for the travelling salesman location problem on the plane
- The parallel complexity of TSP heuristics
- Truly tight bounds for TSP heuristics
- New TSP construction heuristics and their relationships to the 2-Opt
- New TSP construction heuristics and their relationships to the 2-Opt
- scientific article; zbMATH DE number 151868
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cited In (5)
- The target visitation arc routing problem
- A heuristic framework on a common generalization of the vehicle routing problem and the linear ordering problem
- Global strategies for augmenting the efficiency of TSP heuristics
- Quick updates for \(p\)-opt TSP heuristics
- New TSP construction heuristics and their relationships to the 2-Opt
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 Q3077271)
