Extremal permutations with respect to weak majorizations
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 800376
- Optimal allocation of components in parallel–series and series–parallel systems
- Component allocation for a distributed system: reliability maximization
- Optimal assembly of systems using schur functions and majorization
- Optimal substitution of arguments of an arrangement increasing function based on sufficient statistics for parameter-arguments
Cited in
(4)- An extremal problem of \(d\) permutations containing every permutation of every \(t\) elements
- A note on random permutations and extreme value distributions
- Chaotic numbers of complete bipartite graphs and tripartite graphs
- Quadratic integer programming with application to the chaotic mappings of complete multipartite graphs.
This page was built for publication: Extremal permutations with respect to weak majorizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1815401)