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 ask-matroid-intersection-, matchoid-, vertex packingor travelling salesman-problems.