Improved block rearrangement algorithm
From MaRDI portal
Cites work
- A complete anytime algorithm for number partitioning
- Algorithms for finding copulas minimizing convex functions of sums
- Approximation Algorithms for the Assembly Line Crew Scheduling Problem
- Block rearranging elements within matrix columns to minimize the variability of the row sums
- Bounds for functions of dependent risks
- Bounds for the sum of dependent risks and worst value-at-risk with monotone marginal densities
- Computation of sharp bounds on the distribution of a function of dependent risks
- Computation of sharp bounds on the expected value of a supermodular function of risks with given marginals
- Coskewness under dependence uncertainty
- Extremal dependence concepts
- scientific article; zbMATH DE number 4048925 (Why is no real title available?)
- scientific article; zbMATH DE number 3432940 (Why is no real title available?)
- scientific article; zbMATH DE number 3260230 (Why is no real title available?)
- scientific article; zbMATH DE number 3073200 (Why is no real title available?)
- Model Risk Management
- Optimization by simulated annealing
- Rearrangement algorithm and maximum entropy
- Rearrangement Inequalities
- Sharp bounds for sums of dependent risks
- Solution of a statistical optimization problem by rearrangement methods
- Stochastic bounds on sums of dependent risks
- The complete mixability and convex minimization problems with monotone marginal densities
This page was built for publication: Improved block rearrangement algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7317426)