On the \(K\)th best base of a matroid

DOI10.1016/j.orl.2007.05.007zbMath1153.05305OpenAlexW1970471529MaRDI QIDQ935236

Brahim Chaourar

Publication date: 6 August 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2007.05.007

zbMATH Keywords

extreme pointpolytopefacetbase of a matroid\(k\)-sums of graphs\(K\)th best base of a matroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

The Kth TSP is pseudopolynomial when TSP is polynomial, The facets of the spanning trees polytope, A characterization of uniform matroids, A short proof of a min–max relation for the bases packing of a matroid, On Vertices and Facets of Combinatorial 2-Level Polytopes

Cites Work

• On greedy bases packing in matroids
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
• Matroids and the greedy algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item