Constrained partitioning problems

DOI10.1016/0166-218X(90)90091-PzbMath0734.05030OpenAlexW2066907198MaRDI QIDQ5896609

Rainer E. Burkard, Enyu Yao

Publication date: 1990

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(90)90091-p

zbMATH Keywords

minimum variancematroidspartitioning problemsbalancing objective functionGreedy-like algorithms

Mathematics Subject Classification ID

Partitions of sets (05A18) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (6)

Three-partitioning containing kernels: Complexity and heuristic ⋮ Optimal Partitioning Which Maximizes the Weighted Sum of Products ⋮ Constrained partitioning problems ⋮ Optimal matroid partitioning problems ⋮ Min-Max partitioning problem with matroid constraint ⋮ Unnamed Item

Cites Work

• Balanced optimization problems
• On the complexity of decomposing matrices arising in satellite communication
• Optimal partitions
• Time-slot assignment for TDMA-systems
• Optimal Set Partitioning
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Constrained partitioning problems