Polyhedra and optimization in connection with a weak majorization ordering
From MaRDI portal
Recommendations
- POLYHEDRA AND OPTIMIZATION RELATED TO A WEAK ABSOLUTE MAJORIZATION ORDERING
- Weak k-majorization and polyhedra
- scientific article; zbMATH DE number 702975
- scientific article; zbMATH DE number 1182566
- Optimization and approximation for polyhedra in separable Hilbert spaces
- Polyhedral aspects of discrete optimization
- Majorization polytopes
- Polyhedral approximations in p-order cone programming
- On the order dimension of convex polytopes
Cites work
- Geometric algorithms and combinatorial optimization
- scientific article; zbMATH DE number 3904331 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 193053 (Why is no real title available?)
- scientific article; zbMATH DE number 3325507 (Why is no real title available?)
- Inequalities: theory of majorization and its applications
- Lectures on Polytopes
- Matroids and the greedy algorithm
- Submodular functions and optimization
Cited in
(5)
This page was built for publication: Polyhedra and optimization in connection with a weak majorization ordering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5101434)