scientific article; zbMATH DE number 5582828
From MaRDI portal
Publication:5321485
zbMath1167.90693MaRDI QIDQ5321485
Publication date: 22 July 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Comparison of Tabu/2-opt heuristic and optimal tree search method for assignment problems ⋮ Optimizing ontology alignments through a memetic algorithm using both MatchFmeasure and unanimous improvement ratio ⋮ Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem ⋮ An efficient local search for the feedback vertex set problem ⋮ A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem ⋮ Genetic algorithm for combinatorial path planning: the subtour problem ⋮ Estimation-based metaheuristics for the probabilistic traveling salesman problem ⋮ A gene-pool based genetic algorithm for TSP ⋮ An effective local search for the maximum clique problem ⋮ Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers
Uses Software
