On circuit valuation of matroids
From MaRDI portal
Publication:5933469
DOI10.1006/aama.2000.0716zbMath0979.05028MaRDI QIDQ5933469
Publication date: 17 February 2002
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/aama.2000.0716
05B35: Combinatorial aspects of matroids and geometric lattices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convexity and Steinitz's exchange property
- Linear quadratic programming in oriented matroids
- Valuated matroids: A new look at the greedy algorithm
- A finite crisscross method for oriented matroids
- Perfect matroids
- Valuated matroids
- Oriented matroids
- Orientability of matroids
- A combinatorial abstraction of linear programming
- Fenchel-type duality for matroid valuations
- Discrete convex analysis
- Two-best solutions under distance constraints: The model and exemplary results for matroids
- Matroid valuation on independent sets
- Grassmann-Plücker relations and matroids with coefficients
- Well-layered maps and the maximum-degree \(k \times k\)-subdeterminant of a matrix of rational functions
- Finding optimal minors of valuated bimatroids
- Matroid basis graphs. I
- Complementarity in Oriented Matroids
- LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS
- Valuated Matroid Intersection I: Optimality Criteria
- Valuated Matroid Intersection II: Algorithms
- Lectures on matroids
- Theory of Matroids
- Matrices and matroids for systems analysis
