Optimal Partitioning Which Maximizes the Weighted Sum of Products

DOI10.1007/978-3-319-59605-1_12zbMath1492.90149OpenAlexW2620543813MaRDI QIDQ4632209

Kai Jin

Publication date: 26 April 2019

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-59605-1_12

zbMATH Keywords

greedy algorithmsrearrangement inequalitysum of products\(K\)-partitionpartitioning with additive objective

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• An asymptotic approximation scheme for the concave cost bin packing problem
• Localizing combinatorial properties of partitions
• Optimal partitions
• Optimal partitions having disjoint convex and conic hulls
• Optimal Set Partitioning
• On Grouping for Maximum Homogeneity
• Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment
• Technical Note—A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment
• Structured Partitioning Problems
• Optimal Partitioning Which Maximizes the Sum of the Weighted Averages
• Bin‐packing problem with concave costs of bin utilization
• Constrained partitioning problems

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