Pareto Local Optimum Sets in the Biobjective Traveling Salesman Problem: An Experimental Study

This publication has 23 references indexed in Scilit:

• A Study of Global Convexity for a Multiple Objective Travelling Salesman Problem
  2002
• Inferential Performance Assessment of Stochastic Optimisers and the Attainment Function
  2001
• Tabu Search Based Procedure for Solving the 0-1 MultiObjective Knapsack Problem: The Two Objectives Case
  Journal of Heuristics, 2000
• Approximation algorithms for combinatorial multicriteria optimization problems
  International Transactions in Operational Research, 2000
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
  Journal of Multi-Criteria Decision Analysis, 1998
• On the performance assessment and comparison of stochastic multiobjective optimizers
  1996
• Fast Algorithms for Geometric Traveling Salesman Problems
  INFORMS Journal on Computing, 1992
• On cardinality of the set of alternatives in discrete many-criterion problems
  Discrete Mathematics and Applications, 1992
• A Method for Solving Traveling-Salesman Problems
  Operations Research, 1958
• The Traveling-Salesman Problem
  Operations Research, 1956