Some Abstract Pivot Algorithms
From MaRDI portal
Publication:4103542
DOI10.1137/0129045zbMath0337.05022OpenAlexW1986126741MaRDI QIDQ4103542
Curtis Greene, Thomas L. Magnanti
Publication date: 1975
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/5113
Combinatorial aspects of matroids and geometric lattices (05B35) Algorithms in computer science (68W99)
Related Items (17)
Rainbow and monochromatic circuits and cocircuits in binary matroids ⋮ Approximate Maximin Share Allocations in Matroids ⋮ On maximin share allocations in matroids ⋮ Alternating Basis Exchanges in Matroids ⋮ A Protocol for Cutting Matroids Like Cakes ⋮ Some Small Circuit-Cocircuit Ramsey Numbers for Matroids ⋮ On generalisations of the Aharoni–Pouzet base exchange theorem ⋮ Exchange Distance of Basis Pairs in Split Matroids ⋮ A unique exchange property for bases ⋮ Interactive optimization of submodular functions under matroid constraints ⋮ Bounding the payment of approximate truthful mechanisms ⋮ On Sequential Basis Exchange in Matroids ⋮ Intervals in matroid basis graphs ⋮ More on complementary trees ⋮ The Held—Karp algorithm and degree-constrained minimum 1-trees ⋮ Bimatroids and invariants ⋮ Applications of matroid partition to tree decomposition
This page was built for publication: Some Abstract Pivot Algorithms
