| Article ID: | iaor2006975 |
| Country: | Netherlands |
| Volume: | 33 |
| Issue: | 4 |
| Start Page Number: | 389 |
| End Page Number: | 394 |
| Publication Date: | Jul 2005 |
| Journal: | Operations Research Letters |
| Authors: | Nakamura Masataka |
| Keywords: | greedy algorithms |
A polygreedoid and a poly-antimatroid are the generalization of a greedoid and an antimatroid, respectively, obtained by allowing a word to include repeated elements. We shall describe the algorithmic characterizations of a polygreedoid and of a poly-antimatroid based on bottleneck types of greedy algorithms. A notion of score space is investigated for further study of poly-antimatroids.