Optimal Set Partitioning

DOI10.1137/0606015zbMath0555.05010OpenAlexW2021051430MaRDI QIDQ3218131

No author found.

Publication date: 1985

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0606015

zbMATH Keywords

scheduling problemsinterval functionset partitioningset functionsclustering problemssuperadditive functionsreliability problemsminimum-ordered function

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Combinatorial aspects of partitions of integers (05A17) Dynamic programming (90C39)

Related Items (13)

Localizing combinatorial properties of partitions ⋮ Three-partitioning containing kernels: Complexity and heuristic ⋮ A new approach to solve open-partition problems ⋮ Lower bounds and modified LPT algorithm for \(k\)-partitioning problems with partition matroid constraint ⋮ Optimal Partitioning Which Maximizes the Weighted Sum of Products ⋮ A polytope approach to the optimal assembly problem ⋮ Constrained partitioning problems ⋮ Optimal partitions having disjoint convex and conic hulls ⋮ Are there more almost separable partitions than separable partitions? ⋮ Min-Max partitioning problem with matroid constraint ⋮ Enumerating nested and consecutive partitions ⋮ \(k\)-partitioning problems with partition matroid constraint ⋮ Dynamic programming and convex clustering

Cites Work

• Unnamed Item
• Optimal partitions
• 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

This page was built for publication: Optimal Set Partitioning