Pages that link to "Item:Q3343749"
From MaRDI portal
The following pages link to Permuting Elements Within Columns of a Matrix in Order to Minimize Maximum Row Sum (Q3343749):
Displaying 13 items.
- Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime (Q341463) (← links)
- Approximating the multi-level bottleneck assignment problem (Q453052) (← links)
- Packing random items of three colors (Q1200281) (← links)
- Rearrangement algorithm and maximum entropy (Q1708515) (← links)
- Block rearranging elements within matrix columns to minimize the variability of the row sums (Q1743640) (← links)
- Joint mixability of some integer matrices (Q1751157) (← links)
- On line sum optimization (Q2228118) (← links)
- Centers of probability measures without the mean (Q2312782) (← links)
- Improved algorithms for computing worst value-at-risk (Q2397478) (← links)
- Methods of local search for a problem on the permutation of the columns of a binary matrix (Q2895861) (← links)
- On the matrix permutation problem (Q3735433) (← links)
- Workface planning in synchronous production systems (Q5953343) (← links)
- Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations (Q6164589) (← links)