Optimal Set-Partitioning Based on Group Quality likelihood using Partition-Growing Algorithm

We consider the problem of partitioning a set of elements X into a minimum of m blocks to maximize the probability that each block constitutes a well-grouped subset of X. We employ certain characte...

[1]  Francisco Barahona,et al.  On some difficult linear programs coming from set partitioning , 2002, Discret. Appl. Math..

[2]  Cid C. de Souza,et al.  A Relax-and-Cut algorithm for the set partitioning problem , 2008, Comput. Oper. Res..

[3]  G. L. Thompson,et al.  THE COLUMN SUBSTRACTION ALGORITHM: AN EXACT METHOD FOR SOLVING THE WEIGHTED SET COVERING PROBLEM , 1989 .

[4]  Candace A. Yano,et al.  A Multiplier Adjustment Approach for the Set Partitioning Problem , 1992, Oper. Res..

[5]  Gautam Mitra,et al.  Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations , 1992 .

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  Agha Iqbal Ali.  Reformulation of the set partitioning problem as apure network with special order set constraints , 1998, Ann. Oper. Res..

[8]  Gautam Mitra,et al.  Graph theoretic relaxations of set covering and set partitioning problems , 1995 .

[9]  M. Diaby.  Linear programming formulation of the set partitioning problem , 2010 .

[10]  M. Fisher,et al.  Optimal solution of set covering/partitioning problems using dual heuristics , 1990 .

[11]  K. H. Kim,et al.  A heuristic for vehicle fleet mix problem using tabu search and set partitioning , 2008, J. Oper. Res. Soc..

[12]  Martin W. P. Savelsbergh,et al.  A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems , 2001, INFORMS J. Comput..

[13]  Gerald L. Thompson,et al.  The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems , 1994, Comput. Oper. Res..

[14]  Michael Droettboom.  Correcting broken characters in the recognition of historical printed documents , 2003, 2003 Joint Conference on Digital Libraries, 2003. Proceedings..

[15]  Mark W. Lewis,et al.  A new modeling and solution approach for the set-partitioning problem , 2008, Comput. Oper. Res..

[16]  Tin Kam Ho,et al.  Enhancing degraded document images via bitmap clustering and averaging , 1997, Proceedings of the Fourth International Conference on Document Analysis and Recognition.

[17]  Hong Yan,et al.  Linking broken character borders with variable sized masks to improve recognition , 1996, Pattern Recognit..

[18]  Anito Joseph,et al.  A concurrent processing framework for the set partitioning problem , 2002, Comput. Oper. Res..

[19]  Marco A. Boschetti,et al.  A dual ascent procedure for the set partitioning problem , 2008, Discret. Optim..

[20]  R. E. Marsten.  An Algorithm for Large Set Partitioning Problems , 1974 .

[21]  Agha Iqbal Ali,et al.  A network relaxation based enumeration algorithm for set partitioning , 1989 .

[22]  Abilio Lucena.  Non Delayed Relax-and-Cut Algorithms , 2005, Ann. Oper. Res..

[23]  Hanif D. Sherali,et al.  Tighter Representations for Set Partitioning Problems , 1996, Discret. Appl. Math..

[24]  Francisco Barahona,et al.  The volume algorithm: producing primal solutions with a subgradient method , 2000, Math. Program..

[25]  Marco Di Summa,et al.  Minimally Infeasible Set-Partitioning Problems with Balanced Constraints , 2007, Math. Oper. Res..

[26]  E. Balas,et al.  Set Partitioning: A survey , 1976 .

[27]  Geraldo Robson Mateus,et al.  A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows , 2007, Comput. Oper. Res..