Optimal Partitioning Which Maximizes the Sum of the Weighted Averages

DOI10.1287/OPRE.43.3.500MaRDI QIDQ4861365zbMATHOpenAlexFDO

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

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)

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

Cited in

(7)

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

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)