Fast and high precision algorithms for optimization in large-scale genomic problems
From MaRDI portal
Publication:2490543
DOI10.1016/j.compbiolchem.2004.08.003zbMath1089.92013OpenAlexW2050023500WikidataQ51984081 ScholiaQ51984081MaRDI QIDQ2490543
Y. I. Ronin, D. I. Mester, Abraham B. Korol, Eviatar Nevo
Publication date: 16 May 2006
Published in: Computational Biology and Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.compbiolchem.2004.08.003
Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Biochemistry, molecular biology (92C40) Computational methods for problems pertaining to biology (92-08)
Related Items
Active-guided evolution strategies for large-scale capacitated vehicle routing problems, Multilocus consensus genetic maps (MCGM): Formulation, algorithms, and results
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Bootstrap methods: another look at the jackknife
- Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- Guided local search and its application to the traveling salesman problem
- Future paths for integer programming and links to artificial intelligence
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
- Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows
