Block rearranging elements within matrix columns to minimize the variability of the row sums
type: Item
instance of: scholarly article
title: Block rearranging elements within matrix columns to minimize the variability of the row sums
zbMATH Open document ID: 1384.90041
author: Edgars Jakobsons
author: Steven Vanduffel
author: Leopoldo Catania
published in: 4OR
publication date: 2018-04-13T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B90
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6859784
zbMATH Keywords: assembly line crew scheduling
zbMATH Keywords: greedy algorithm
zbMATH Keywords: rearrangements
zbMATH Keywords: \(k\)-partitioning
zbMATH Keywords: Karmarkar-Karp differencing algorithm
MaRDI profile type: Publication
OpenAlex ID: W3123892924
cites work: Joint Mixability
cites work: Algorithms for Finding Copulas Minimizing Convex Functions of Sums
cites work: Quantile of a mixture with application to model risk assessment
cites work: Multivariate arrangement increasing functions with applications in probability and statistics
cites work: The partition problem
cites work: Permuting Elements Within Columns of a Matrix in Order to Minimize Maximum Row Sum
cites work: Rearrangement Inequalities
cites work: Optimal Scheduling of Tasks on Identical Parallel Processors
cites work: Heuristic and exact algorithms for the identical parallel machine scheduling problem
cites work: A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
cites work: Bounds for Certain Multiprocessing Anomalies
cites work: Approximation Algorithms for the Assembly Line Crew Scheduling Problem
cites work: A complete anytime algorithm for number partitioning
cites work: Inequalities: theory of majorization and its applications
cites work: Phase Transition in the Number Partitioning Problem
cites work: An exact algorithm for the identical parallel machine scheduling problem.
cites work: Computation of sharp bounds on the distribution of a function of dependent risks
cites work: Extremal dependence concepts
cites work: Mathematical Risk Analysis
cites work: Stochastic orders
cites work: The complete mixability and convex minimization problems with monotone marginal densities
DOI: 10.1007/S10288-017-0344-4
Recommended article: Permuting Elements Within Columns of a Matrix in Order to Minimize Maximum Row Sum
Recommended article: Matrices with prescribed row, column and block sums
Recommended article: Reordering a sparse matrix to a sparse blocked form
Recommended article: Matrices with prescribed row and column sums
Recommended article: Permuting Sparse Rectangular Matrices into Block-Diagonal Form
Recommended article: A Block Ordering Method for Sparse Matrices
Recommended article: Decomposing Matrices into Blocks
Recommended article: A method for maximizing matrix columns
Recommended article: Q3338385
Recommended article: Generalizing the column-row matrix decomposition to multi-way arrays
description: scientific article; zbMATH DE number 6859784