Closure in Independence Systems

DOI10.1287/moor.7.2.159zbMath0498.90060OpenAlexW2058552755MaRDI QIDQ3964324

Laurence R. Matthews

Publication date: 1982

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.7.2.159

zbMATH Keywords

combinatorial optimizationdualitygreedy algorithmclosure operatorsmatroidtravelling salesmanindependence systemacyclic subgraphpaintings

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (4)

Rank-axiomatic characterizations of independence systems ⋮ In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton ⋮ Minimum partition of an independence system into independent sets ⋮ On the greedy algorithm with random costs

This page was built for publication: Closure in Independence Systems