On a classification of independence systems

By generalizing matroid axiomatics we provide a framework in which independence systems may be classified. The concept is applied to independence systems arising from well known combinatorial optimization problems such as k-matroid intersection, matchoid, vertex packing in finite graphs and travelling salesman problems.