Least Majorized Elements and Generalized Polymatroids

DOI10.1287/MOOR.20.3.583MaRDI QIDQ4864873zbMATH OpenOpenAlexFDO

Authors Arie Tamir

Publication date 25 February 1996

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.20.3.583

zbMATH Keywords

bounded generalized polymatroid

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 3906513
• Polyhedra and optimization in connection with a weak majorization ordering
• Characterizing and recognizing generalized polymatroids
• Integral majorization polytopes
• Weak k-majorization and polyhedra

Cited in

(9)

• Majorization, packing, covering and matroids
• The membership problem in jump systems
• Decreasing minimization on M-convex sets: background and structures
• Faster algorithms for semi-matching problems
• Integral majorization polytopes
• A note on polyhedral sets having A least element
• Truthful mechanism design via correlated tree rounding
• Resource sharing revisited: local weak duality and optimal convergence
• Pricing for fairness: distributed resource allocation for multiple objectives

This page was built for publication: Least Majorized Elements and Generalized Polymatroids

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