• ils-mwis

  • Referenced in 8 articles [sw41470]
  • hybrid iterated local search heuristic for the maximum weight independent set problem. This paper presents ... hybrid iterated local search (ILS) algorithm for the maximum weight independent set (MWIS) problem ... balance between intensification and diversification during the search. The proposed algorithm was tested ... those found by state-of-the-art heuristics and exact methods. Our heuristic outperforms...
  • gpuls-mwcp

  • Referenced in 5 articles [sw41468]
  • local search heuristic for the maximum weight clique problem on massive graphs. Given an undirected ... present a CPU-GPU local search heuristic for solving the MWCP on massive graphs...
  • KaHyPar

  • Referenced in 7 articles [sw20718]
  • level approach combined with strong local search heuristics, it computes solutions of very high quality...
  • D*Lite

  • Referenced in 7 articles [sw20991]
  • Stentz’ Focussed Dynamic A* is a heuristic search method that repeatedly determines a shortest path...
  • HAS-QAP

  • Referenced in 36 articles [sw20506]
  • colony system coupled with a local search, applied to the quadratic assignment problem ... best heuristics available for the QAP: two versions of tabu search, namely, robust and reactive...
  • HuGS

  • Referenced in 6 articles [sw10598]
  • users to guide the exploration of the search space. These metaphors apply to a wide ... improve the performance of powerful heuristic search algorithms. HuGS is also a valuable development environment ... HuGS code base to develop completely automatic heuristic algorithms that produced at the time...
  • COLIN

  • Referenced in 6 articles [sw27480]
  • describe COLIN, a forward-chaining heuristic search planner, capable of reasoning with COntinuous LINear numeric ... planning. COLIN combines FF-style forward chaining search, with the use of a linear program ... extension of the temporal relaxed planning graph heuristic of CRIKEY3, to support reasoning directly with...
  • 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...
  • TSPAntSim

  • Referenced in 6 articles [sw04980]
  • using ACO algorithms with local search heuristics. Algorithms are tested on benchmark problems from TSPLIB...
  • NMRDPP

  • Referenced in 6 articles [sw10437]
  • detail. These include dynamic programming, heuristic search, and structured methods. Using NMRDPP, we compare...
  • Zeno

  • Referenced in 10 articles [sw07735]
  • converts the proof into Isabelle code. Zeno searches for a proof tree by iteratively reducing ... have adapted known, and developed new, heuristics ... reduction of the search space. Our new heuristics aim to promote the application of function...
  • LPG

  • Referenced in 12 articles [sw20690]
  • evaluation function uses some heuristics to estimate the ”search cost” and the ”execution cost...
  • DINS

  • Referenced in 8 articles [sw10145]
  • introduce Distance Induced Neighbourhood Search (DINS), a MIP improvement heuristic that tries to find improved ... based on a variation of local search that is embedded in an exact MIP solver ... exact solver. DINS considers each defined search neighbourhood as a new MIP problem and explores ... improvement heuristics Local Branching due to Fischetti and Lodi and Relaxation Induced Neighbourhood Search...
  • FastFDs

  • Referenced in 11 articles [sw01613]
  • based on a depth-first, heuristic-driven (DFHD) search for finding minimal covers of hypergraphs...
  • QCQP

  • Referenced in 5 articles [sw27001]
  • programs (QCQPs) using relaxations and local search heuristics. Our heuristics are based on the Suggest ... Suggest method and performs a local search to find a better point. The notion...
  • BioNet

  • Referenced in 5 articles [sw13828]
  • methods for optimal, suboptimal and fast heuristic searches, as well as routines for the visualization...
  • DupTree

  • Referenced in 5 articles [sw12376]
  • upon the run time of standard search heuristics for gene tree parsimony, and enables...
  • bnstruct

  • Referenced in 4 articles [sw29260]
  • package implements the Silander-Myllymaki complete search, the Max-Min Parents-and-Children, the Hill ... Climbing, the Max-Min Hill-climbing heuristic searches, and the Structural Expectation-Maximization algorithm. Available...
  • MOCHA

  • Referenced in 4 articles [sw08579]
  • matroid optimization, we have developed algorithms and heuristics aimed at practical solution of large instances ... also present a modified breadth-first-search heuristic that uses adjacency to enumerate a subset...
  • MOAPPS

  • Referenced in 11 articles [sw13459]
  • production planning using the multiple-objective tabu search. In recent years, there has been ... problems using the modern heuristics optimization techniques (i.e. tabu search, genetic algorithms, etc.). This ... need to investigate the suitability of modern heuristics for their solution. In this paper ... specially developed multiple-objective tabu search algorithm. The mathematical formulation is built upon Masud...