A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem

M Haouari () and J S Chaouachi
Additional contact information
M Haouari: Ecole Polytechnique de Tunisie
J S Chaouachi: Ecole Polytechnique de Tunisie

Journal of the Operational Research Society, 2002, vol. 53, issue 7, 792-799

Abstract: Abstract We present a probabilistic greedy search method for combinatorial optimisation problems. This approach is implemented and evaluated for the Set Covering Problem (SCP) and shown to yield a simple, robust, and quite fast heuristic. Tests performed on a large set of benchmark instances with up to 1000 rows and 10 000 columns show that the algorithm consistently yields near-optimal solutions.

Keywords: combinatorial optimisation; greedy method; heuristics; set covering problem (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2601366 Abstract (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:53:y:2002:i:7:d:10.1057_palgrave.jors.2601366

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2601366

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().