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

G. Edward Fox and Christopher J. Nachtsheim

Naval Research Logistics (NRL), 1990, vol. 37, issue 2, 299-307

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.

Date: 1990
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199004)37:23.0.CO;2-M

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:wly:navres:v:37:y:1990:i:2:p:299-307

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().