๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Probabilistic analysis of output cost of a heuristic search algorithm

โœ Scribed by Pradip K. Srimani

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
514 KB
Volume
47
Category
Article
ISSN
0020-0255

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Analysis of a Local Search Heuristic for
Analysis of a Local Search Heuristic for Facility Location Problems
โœ Madhukar R. Korupolu; C.Greg Plaxton; Rajmohan Rajaraman ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 258 KB

In this paper, we study approximation algorithms for several NP-hard facility location problems.We prove that a simple local search heuristic yields polynomialtime constant-factor approximation bounds for the metric versions of the uncapacitated k-median problem and the uncapacitated facility locati

Cost analysis and extension of a simple
Cost analysis and extension of a simple maintenance-scheduling heuristic
โœ Peter Kelle; Edward A. Silver; Glen F. Murphy ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 805 KB

Practitioners of maintenance scheduling sometimes use a simple analytic formula, derived based on inspection scheduling, as a heuristic to determine the length of the preventive maintenance period. The sensitivity of this heuristic solution is analyzed and the cost penalties are calculated compared