Weak k-majorization and polyhedra

DOI10.1007/BF01584843zbMATH Open0919.90127MaRDI QIDQ1290598FDOQ1290598

Authors: Geir Dahl, François Margot 

Publication date: 3 June 1999

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Recommendations

• Polyhedra and optimization in connection with a weak majorization ordering
• POLYHEDRA AND OPTIMIZATION RELATED TO A WEAK ABSOLUTE MAJORIZATION ORDERING
• Integral majorization polytopes
• Majorization polytopes
• The \(d\)-majorization polytope

zbMATH Keywords

majorizationpolyhedra

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Geometric algorithms and combinatorial optimization
• Title not available (Why is that?)
• Inequalities: theory of majorization and its applications
• Submodular functions and optimization
• Matroids and the greedy algorithm
• Title not available (Why is that?)

Cited In (10)

• POLYHEDRA AND OPTIMIZATION RELATED TO A WEAK ABSOLUTE MAJORIZATION ORDERING
• On weakly-neighbourly polyhedra
• Integral majorization polytopes
• Majorization, polyhedra, and statistical testing problems
• The \(d\)-majorization polytope
• On Malfatti's marble problem
• Polyhedra and optimization in connection with a weak majorization ordering
• Title not available (Why is that?)
• Facets of the weak order polytope derived from the induced partition projection
• Least Majorized Elements and Generalized Polymatroids

This page was built for publication: Weak \(k\)-majorization and polyhedra

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