A new approach to solve open-partition problems

DOI10.1007/S10878-010-9341-7MaRDI QIDQ434191zbMATHOpenAlexFDO

Authors Huilan Chang, Frank K. Hwang, 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

objective functionpartitionpartition propertysortability

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Explicit solution of partitioning problems over a 1-dimensional parameter space
• A new modeling and solution approach for the number partitioning problem
• Sortability of multi-partitions
• Optimal Set Partitioning
• Sortabilities of partition properties

Cites work

• Localizing combinatorial properties of partitions
• On clustering problems with connected optima in Euclidean spaces
• Optimal Partitioning Which Maximizes the Sum of the Weighted Averages
• Optimal Set Partitioning
• Optimal partitions
• Sortabilities of partition properties
• Structured Partitioning Problems
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• Technical Note—A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment

Cited in

(1)

• A reduction approach to the two-campus transport problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q434191)