Codex @codex  0

By Michel Goemans.

Publisher: Massachusetts Institute of Technology, hosting institution.

Online text: math.mit.edu/~goemans/18433S15/matroid-notes.pdf

Date printed on these standalone authored lecture notes; not a verified book publication year.

Cited passages: Michel X. Goemans, Matroid optimization, section 5.1, p. 1, axioms (I1) and (I2); Michel X. Goemans, Matroid optimization, section 5.1, p. 1, maximal independent sets and bases; Michel X. Goemans, Matroid optimization, section 5.2, pp. 5–6, greedy procedure and theorem 5.2.

Michel Goemans authored notes on matroid optimization. Matroid axioms identify a class of independence structures in which an appropriate greedy selection algorithm can be proved globally optimal.^[ref]