An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem

Article Abstract:

A one edge pass non-greedy algorithm was used for the minimum spanning tree problem. The algorithm was utilized using network labeling procedures and path weights. The results show that greedy algorithms enjoy an advantage over non-greedy algorithms with regard to the minimum spanning tree problem. In the problem tested, non-greedy algorithms proved competitive with greedy approaches in terms of reoptimization modes.

Systems analysis

---

Maximum satisfiability: how good are tabu search and plateau moves in the worst-case?

Article Abstract:

A worst-case analysis on the viability of tabu search algorithms for maximum satisfiability problem is presented.

Switzerland, Algorithm, Search theory

---

Tabu search for DNA sequencing with false negatives and false positives

Article Abstract:

A heuristic algorithm based on tabu search is proposed for the problem of DNA sequencing by hybridization.

Research, DNA, Hybridization

Similar abstracts:

• Abstracts: An application of genetic algorithms for flow shop problems. A primal partitioning approach for single and non-simultaneous multicommodity flow problems
• Abstracts: An exact depth-first algorithm for the pallet loading problem. Move based heuristics for the unidirectional loop network layout problem
• Abstracts: A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Analysis of permutation routing algorithms

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.