scientific article; zbMATH DE number 5876034

zbMath1229.90004MaRDI QIDQ5392120

No author found.

Publication date: 7 April 2011

Full work available at URL: http://www.intechopen.com/books/show/title/traveling-salesman-problem-theory-and-applications

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Collections of articles of miscellaneous specific interest (00B15) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)

Related Items (12)

Improving the performance of metaheuristics: an approach combining response surface methodology and racing algorithms ⋮ Novel concave hull-based heuristic algorithm for TSP ⋮ A new mathematical programming formulation for the single-picker routing problem ⋮ Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices ⋮ A novel tournament selection based differential evolution variant for continuous optimization problems ⋮ Strategies for Generating Well Centered Tetrahedral Meshes on Industrial Geometries ⋮ On the longest flip sequence to untangle segments in the plane ⋮ New mixed integer linear programming models and an iterated local search for the clustered traveling salesman problem with relaxed priority rule ⋮ Effective Covering of Supplied Nanostores in Emerging Cities ⋮ A cutting plane method for risk-constrained traveling salesman problem with random arc costs ⋮ Self-configuring Nature Inspired Algorithms for Combinatorial Optimization Problems ⋮ Scheduling the Flowshop with Zero Intermediate Storage Using Chaotic Discrete Artificial Bee Algorithm

This page was built for publication: