Optimal set-partitioning based on group quality likelihood using partition-growing algorithm

DOI10.1142/S1793830913500225MaRDI QIDQ2874033zbMATH OpenOpenAlexFDO

Authors Chaivatna Sumetphong, Supachai Tangwongsan

Publication date 28 January 2014

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793830913500225

zbMATH Keywords

broken characters recognitiongroup qualityhistorical documentspartition-growing algorithmset partitioning

Mathematics Subject Classification ID

Partitions of sets (05A18) Combinatorial probability (60C05) Applications of mathematical programming (90C90)

Recommendations

• Optimal Set Partitioning
• Set partition by globally optimized cluster seed points
• Structured Partitioning Problems
• scientific article; zbMATH DE number 193829
• scientific article; zbMATH DE number 907944

Cites work

• A concurrent processing framework for the set partitioning problem
• A dual ascent procedure for the set partitioning problem
• A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows
• A heuristic for vehicle fleet mix problem using tabu search and set partitioning
• A Multiplier Adjustment Approach for the Set Partitioning Problem
• A network relaxation based enumeration algorithm for set partitioning
• A new modeling and solution approach for the set-partitioning problem
• A parallel, linear programming-based heuristic for large-scale set partitioning problems
• A relax-and-cut algorithm for the set partitioning problem
• An Algorithm for Large Set Partitioning Problems
• Graph theoretic relaxations of set covering and set partitioning problems
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Linear programming formulation of the set partitioning problem
• Minimally Infeasible Set-Partitioning Problems with Balanced Constraints
• Non delayed relax-and-cut algorithms
• On some difficult linear programs coming from set partitioning
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
• Set Partitioning: A survey
• Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations
• The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
• The volume algorithm: Producing primal solutions with a subgradient method
• Tighter representations for set partitioning problems

This page was built for publication: Optimal set-partitioning based on group quality likelihood using partition-growing algorithm

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