An analysis of six greedy selection rules on a class of zero‐one integer programming models

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

Six greedy primal selection rules are evaluated on a class of generalized set packing models. The evaluation is conducted in accordance with experimental design methodologies proposed by Lin and Rardin. Results indicate that the simplest of rules performs best, except when the model constraints exhibit “mixed” slackness. In this case, the rule proposed earlier by Fox and Scudder performs best. The results clarify and add detail to previous work by Fox and Scudder.

Original languageEnglish (US)
Pages (from-to)299-307
Number of pages9
JournalNaval Research Logistics (NRL)
Volume37
Issue number2
DOIs
StatePublished - Apr 1990

Fingerprint

Dive into the research topics of 'An analysis of six greedy selection rules on a class of zero‐one integer programming models'. Together they form a unique fingerprint.

Cite this