Least Majorized Elements and Generalized Polymatroids

DOI10.1287/MOOR.20.3.583zbMATH Open0839.90097OpenAlexW2163244890MaRDI QIDQ4864873FDOQ4864873

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

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

zbMATH Keywords

bounded generalized polymatroid

Mathematics Subject Classification ID

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

Cited In (8)

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

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)