An Algorithmic Characterization of Antimatroids

Simple item page
dc.contributor.authorBoyd, E. Andrew
dc.date.accessioned2018-06-18T17:27:39Z
dc.date.available2018-06-18T17:27:39Z
dc.date.issued1987-12
dc.date.noteDecember 1987
dc.description.abstractIn an article entitled "Optimal sequencing of a single machine subject to precedence constraints," E.L. Lawler presented a now classical minmax result for job scheduling. In essence, Lawler's proof demonstrated that the properties of partially ordered sets were sufficient to solve the posed scheduling problem. These properties are, in fact, common to a more general class of combinatorial structures known as <em>antimatroids</em>, which have recently received considerable attention in the literature. It is demonstrated that the properties of antimatroids are not only sufficient but necessary to solve the scheduling problem posed by Lawler, thus yielding an algorithmic characterization of antimatroids. Examples of problems solvable by the general result are provided.
dc.format.extent19 pp
dc.identifier.citationBoyd, E. Andrew. "An Algorithmic Characterization of Antimatroids." (1987) <a href="https://hdl.handle.net/1911/101636">https://hdl.handle.net/1911/101636</a>.
dc.identifier.digitalTR87-27
dc.identifier.urihttps://hdl.handle.net/1911/101636
dc.language.isoeng
dc.titleAn Algorithmic Characterization of Antimatroids
dc.typeTechnical report
dc.type.dcmiText
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR87-27.pdf
Size:
237.59 KB
Format:
Adobe Portable Document Format
Download
Collections
CAAM Technical Reports