scientific article; zbMATH DE number 2102230

zbMath1162.90537MaRDI QIDQ4817407

Laurent Gourvès, Evripidis Bampis, Eric Angel

Publication date: 22 September 2004

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

zbMATH Keywords

dynamic programmingneighborhood searchbicriteria TSP

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items (10)

Variable and large neighborhood search to solve the multiobjective set covering problem ⋮ Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem ⋮ Many-objective Pareto local search ⋮ Proper balance between search towards and along Pareto front: biobjective TSP case study ⋮ Hybridizations of evolutionary algorithms with large neighborhood search ⋮ On local optima in multiobjective combinatorial optimization problems ⋮ On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems ⋮ Two-phase Pareto local search for the biobjective traveling salesman problem ⋮ Design and analysis of stochastic local search for the multiobjective traveling salesman problem ⋮ Speed-up techniques for solving large-scale biobjective TSP

This page was built for publication: