A new approach to solve open-partition problems

DOI10.1007/s10878-010-9341-7zbMath1244.90189OpenAlexW2092320465MaRDI QIDQ434191

Frank K. Hwang, Huilan Chang, Uriel G. Rothblum

Publication date: 10 July 2012

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-010-9341-7

zbMATH Keywords

partitionobjective functionpartition propertysortability

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

A reduction approach to the two-campus transport problem

Cites Work

• On clustering problems with connected optima in Euclidean spaces
• Localizing combinatorial properties of partitions
• Optimal partitions
• Sortabilities of partition properties
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• Optimal Set Partitioning
• 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

This page was built for publication: A new approach to solve open-partition problems