General local research methods

Article Abstract:

The principle, implementation and selected literature of three currently applied heuristic methods, simulated annealing, tabu search and genetic algorithms, are illustrated in the context of meta-algorithms. They are characterized by two advantages: similarity to so-called natural optimization systems and presence of theoretical convergence results. Combination of the three methods is weighed for maximum results while comparisons are governed by easy usage, strength and dependability of parameter settings, solution quality and computational ability.

Usage, Heuristic programming, Simulated annealing (Mathematics)

---

Local base station assignment with time intervals in mobile computing environments

Article Abstract:

The local station assignment (LSA) problems with data access costs are characterized using three parameters, namely number of distinct connect times, maximum number of preferred base stations specified by a user and maximum allowable load on any base station. The data access services are supplied to mobile users, who may connect and disconnect at any time, by many telecommunication service providers.

Computer networks, Computational complexity, Computational complexity (Machine theory), Information networks

---

Performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid

Article Abstract:

A study is conducted to examine the efficacy of greedy algorithm in solving minimization p-median problem is presented.

Russia, Algorithms, Algorithm

Similar abstracts:

• Abstracts: Generalized bilinear programming: an application in farm management. A comparison of standard and two-stage mathematical programming discriminant analysis methods
• Abstracts: Computational experience with approximation algorithms for the set covering problem. Endurance in speed skating: the development of world records
• Abstracts: Reallocation of paths of ABR services in a multistage interconnection network (MIN)-type ATM switch network. A preference-based approach to spanning trees and shortest paths problems
• Abstracts: Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption
• Abstracts: Optimal procurement decisions in the presence of total quantity discounts and alternative product recipes. Evaluation of time-varying availability in multi-echelon spare parts systems with passivation

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