A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem
From MaRDI portal
Publication:4656683
DOI10.1057/palgrave.jors.2601366zbMath1130.90389OpenAlexW1964312519MaRDI QIDQ4656683
Mohamed Haouari, Jouhaina Siala Chaouachi
Publication date: 14 March 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601366
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
An effective and simple heuristic for the set covering problem, A distance-limited continuous location-allocation problem for spatial planning of decentralized systems, Application placement and backup service in computer clustering in software as a service (SaaS) networks, A hybrid heuristic for the set covering problem, A tabu search heuristic for the generalized minimum spanning tree problem, An electromagnetism metaheuristic for the unicost set covering problem, The set covering problem revisited: an empirical study of the value of dual information, Heuristics for the variable sized bin-packing problem, Exploring further advantages in an alternative formulation for the set covering problem, Upper and lower bounding strategies for the generalized minimum spanning tree problem
Uses Software
