scientific article; zbMATH DE number 3858856

MaRDI QIDQ3328285zbMATH OpenFDO

Authors Bernhard Korte

Publication date 1982

zbMATH Keywords

combinatorial optimizationcomputational complexityindependence systemsmatroidsoracle techniquespolynomialitysurvey

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 4066909
• scientific article; zbMATH DE number 3952499
• Matroids you have known
• scientific article; zbMATH DE number 4027489
• A new exchange property for matroids and its application to max-min-problems

Cited in

(19)

• Minimum partition of an independence system into independent sets
• Boolean techniques for matroidal decomposition of independence systems and applications to graphs
• Pseudomatroids
• A characterization of matroidal systems of inequalities
• An ordered independence system and its applications to scheduling problems
• A constrained independent set problem for matroids
• A note on independence systems and matroids
• On the geometric structure of independence systems
• Ordered matroids and regular independence systems
• Independence and port oracles for matroids, with an application to computational learning theory
• Matroids and combinatorial optimisation
• scientific article; zbMATH DE number 4214017 (Why is no real title available?)
• Matroids you have known
• scientific article; zbMATH DE number 3918383 (Why is no real title available?)
• Bimatroidal independence systems
• scientific article; zbMATH DE number 4187824 (Why is no real title available?)
• Matrices and matroids for systems analysis
• Recent trends in combinatorial optimization
• Matroidizing set systems: A new approach to matroid theory

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3328285)