Results 1 to 20 of 235
Sort by:

  • GTSP-LIB
  • Referenced in 6 articles [sw25565]
  • GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem. This paper ... GTSP based on an adaptive large neighborhood search. The algorithm operates by repeatedly removing from...

  • ToOLS
  • Referenced in 4 articles [sw21244]
  • hybrid local/global search methods called Large Neighborhood Search, which is very naturally suited...

  • RNAiFold2T
  • Referenced in 0 articles [sw15050]
  • Constraint Programming (CP) and Large Neighborhood Search (LNS) algorithms to solve this problem. Benchmarking tests...

  • Localizer++
  • Referenced in 4 articles [sw20670]
  • fundamental approaches to tackle large combinatorial optimization problems. Yet relatively little support is available ... search algorithms. This paper introduces Localizer++, an extensible object-oriented library for local search. Localizer ... supports both declarative abstractions to describe the neighborhood and high-level search constructs to specify...

  • NeMa
  • Referenced in 5 articles [sw18899]
  • NeMa: fast graph search with label similarity. It is increasingly common to find real-life ... given query graph in a (typically large) network modeled as a target graph ... paper, we propose NeMa (Network Match), a neighborhood-based subgraph matching technique for querying real ... effective and efficient compared to the keyword search and various state-of-the-art graph...

  • MorpheuS
  • Referenced in 1 article [sw36062]
  • advances in cloud computing have enabled large-scale complex computations such as deep models ... piece. An efficient optimization metaheuristic, variable neighborhood search, generates music by assigning pitches that best...

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

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

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

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

  • gmp
  • Referenced in 289 articles [sw00363]
  • GMP is a free library for arbitrary precision...

  • KNITRO
  • Referenced in 200 articles [sw00490]
  • KNITRO is a solver for nonlinear optimization. It...

  • Macaulay2
  • Referenced in 1958 articles [sw00537]
  • Macaulay2 is a software system devoted to supporting...

  • MALLBA
  • Referenced in 28 articles [sw00542]
  • The MALLBA project tackles the resolution of combinatorial...

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

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

  • Paramils
  • Referenced in 87 articles [sw00678]
  • Paramils: an automatic algorithm configuration framework. The identification...

  • PSwarm
  • Referenced in 70 articles [sw00742]
  • PSwarm: a hybrid solver for linearly constrained global...

  • QAPLIB
  • Referenced in 236 articles [sw00751]
  • A collection of electronically available data instances for...