Optimal Partitioning Which Maximizes the Sum of the Weighted Averages

DOI10.1287/OPRE.43.3.500zbMATH Open0840.90108OpenAlexW2170995957MaRDI QIDQ4861365FDOQ4861365

Authors: Shmuel Gal, Boris Klots 

Publication date: 4 July 1996

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.43.3.500

Recommendations

• Optimal Partitioning Which Maximizes the Weighted Sum of Products
• scientific article; zbMATH DE number 3908442
• The \(k\)-partitioning problem
• Optimal Partitioning of Sequences
• Structured Partitioning Problems

zbMATH Keywords

optimal partitioningassignment of computer jobs to a multiple cache

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited In (7)

• Screening multi‐dimensional heterogeneous populations for infectious diseases under scarce testing resources, with application to <scp>COVID</scp>‐19
• A new approach to solve open-partition problems
• \(M\)-partitions: optimal partitions of weight for one scale pan
• Title not available (Why is that?)
• On the number of separable partitions
• An optimization problem arising in the design of multiring systems
• Optimal Partitioning Which Maximizes the Weighted Sum of Products

This page was built for publication: Optimal Partitioning Which Maximizes the Sum of the Weighted Averages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4861365)