Improved integral simplex using decomposition for the set partitioning problem

Balas, 1972, On the set-covering problem, Oper Res, 20, 1152, 10.1287/opre.20.6.1152

Balas, 1975, On the set-covering problem: II. An algorithm for set partitioning, Oper Res, 23, 74, 10.1287/opre.23.1.74

El Hallaoui, 2011, An improved primal simplex algorithm for degenerate linear programs, INFORMS J Comput, 23, 569, 10.1287/ijoc.1100.0425

Haus, 2001, The integral basis method for integer programming, Math Methods Oper Res, 53, 353, 10.1007/s001860100124

Rönnberg, 2009, Column generation in the integral simplex method, Eur J Oper Res, 192, 333, 10.1016/j.ejor.2007.09.037

Rosat S, El Hallaoui I, Soumis F, Lodi A (2014) Integral simplex using decomposition with primal cuts. In: Experimental algorithms. Springer International Publishing, pp 22–33

Rosat S, El Halaoui I, Soumis F, Chakour D (2017) Influence of the normalization constraint on the integral simplex using decomposition. Discrete Appl Math 217(1):53–70

Saxena A (2003) Set-partitioning via integral simplex method. Doctoral dissertation, Ph. D. thesis, Carnegie Mellon University, Pittsburgh

Thompson, 2002, An integral simplex algorithm for solving combinatorial optimization problems, Comput Optim Appl, 22, 351, 10.1023/A:1019758821507

Zaghrouti A, El Hallaoui I, Soumis F (2013) Improving ILP solutions by zooming around an improving direction. Les Cahiers du GERAD G-2013-107

Zaghrouti, 2014, Integral simplex using decomposition for the set partitioning problem, Oper Res, 62, 435, 10.1287/opre.2013.1247