OPTIMAL SET-PARTITIONING BASED ON GROUP QUALITY LIKELIHOOD USING PARTITION-GROWING ALGORITHM

DOI10.1142/S1793830913500225zbMath1309.05027OpenAlexW1982899876MaRDI QIDQ2874033

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

set partitioninghistorical documentsbroken characters recognitiongroup qualitypartition-growing algorithm

Mathematics Subject Classification ID

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

Cites Work

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

This page was built for publication: OPTIMAL SET-PARTITIONING BASED ON GROUP QUALITY LIKELIHOOD USING PARTITION-GROWING ALGORITHM