• GTSP Instances Library

  • Referenced in 14 articles [sw14651]
  • Generalized Traveling Salesman Problem (GTSP) is an extension of the Traveling Salesman Problem (TSP), where...
  • GTSP-LIB

  • Referenced in 6 articles [sw25565]
  • neighborhood search heuristic for the generalized traveling salesman problem. This paper presents a new solver ... exactly one-in-a-set generalized traveling salesman problem (GTSP). In the GTSP, a complete ... vertices in the tour. We propose a general insertion mechanism that contains, as special cases...
  • HyFlex

  • Referenced in 12 articles [sw07688]
  • designing adaptive general-purpose optimisation algorithms. Six hard combinatorial problems are fully implemented: maximum satisfiability ... packing, permutation flow shop, personnel scheduling, traveling salesman and vehicle routing. Each domain contains ... extensive set of state-of-the-art problem specific heuristics and search operators. HyFlex represents ... valuable new benchmark of heuristic search generality, with which adaptive cross-domain algorithms are being...
  • MPSA

  • Referenced in 2 articles [sw02500]
  • annealing and its application to the traveling salesman problem. The Methodology to Parallelize Simulated Annealing ... parallel Simulated Annealing algorithm that is in general faster than its sequential implementation version while ... parallelizing a SA algorithm for the Traveling Salesman Problem...
  • MEALS

  • Referenced in 2 articles [sw17455]
  • objective ring star problem. This problem consists of finding a simple cycle (ring) through ... ring. The algorithm preserves the general characteristics of a multiobjective evolutionary algorithm and embeds ... scheme utilized leads to solving a Traveling Salesman Problem in order to compute the ring...
  • perm_mateda

  • Referenced in 1 article [sw27196]
  • provide implementations of the Mallows and Generalized Mallows EDAs under the Kendall’s-τ, Cayley ... addition, four classical permutation problems have also been implemented: Traveling Salesman Problem, Permutation Flowshop Scheduling...
  • CARTHAGENE

  • Referenced in 3 articles [sw23159]
  • extremely valuable for locating genes or more generally either qualitative or quantitative trait loci ... presents a new approach to two important problems in genetic mapping: automatically ordering markers ... between the marker ordering problem and the famous traveling salesman problem. The approach has been...
  • BARON

  • Referenced in 354 articles [sw00066]
  • BARON is a computational system for solving nonconvex...
  • cdd

  • Referenced in 115 articles [sw00114]
  • The program cdd+ (cdd, respectively) is a C...
  • CDT

  • Referenced in 12 articles [sw00116]
  • Algorithm 750: CDT: A subroutine for the exact...
  • CLIFFORD

  • Referenced in 84 articles [sw00131]
  • CLIFFORD performs various computations in Grass mann and...
  • CSDP

  • Referenced in 202 articles [sw00169]
  • CSDP, A C Library for Semidefinite Programming. This...
  • GAP

  • Referenced in 3164 articles [sw00320]
  • GAP is a system for computational discrete algebra...
  • GLOB

  • Referenced in 37 articles [sw00357]
  • GLOB -- a new VNS-based software for global...
  • Mathematica

  • Referenced in 6343 articles [sw00554]
  • Almost any workflow involves computing results, and that...
  • Matlab

  • Referenced in 13488 articles [sw00558]
  • MATLAB® is a high-level language and interactive...
  • nauty

  • Referenced in 609 articles [sw00611]
  • graph-theoretic program NAUTY: nauty is a program...