Samer, Phillippe; Cavalcante, Evellyn; Urrutia, Sebastián; Oppen, Johan The matching relaxation for a class of generalized set partitioning problems. (English) Zbl 1401.05039 Discrete Appl. Math. 253, 153-166 (2019). MSC: 05A18 90C10 90B20 PDFBibTeX XMLCite \textit{P. Samer} et al., Discrete Appl. Math. 253, 153--166 (2019; Zbl 1401.05039) Full Text: DOI arXiv
Sumetphong, Chaivatna; Tangwongsan, Supachai Optimal set-partitioning based on group quality likelihood using partition-growing algorithm. (English) Zbl 1309.05027 Discrete Math. Algorithms Appl. 5, No. 4, Article ID 1350022, 15 p. (2013). MSC: 05A18 60C05 90C90 PDFBibTeX XMLCite \textit{C. Sumetphong} and \textit{S. Tangwongsan}, Discrete Math. Algorithms Appl. 5, No. 4, Article ID 1350022, 15 p. (2013; Zbl 1309.05027) Full Text: DOI
Joseph, Anito A concurrent processing framework for the set partitioning problem. (English) Zbl 0994.90112 Comput. Oper. Res. 29, No. 10, 1375-1391 (2002). MSC: 90C27 PDFBibTeX XMLCite \textit{A. Joseph}, Comput. Oper. Res. 29, No. 10, 1375--1391 (2002; Zbl 0994.90112) Full Text: DOI
Beasley, J. E.; Cao, B. A dynamic programming based algorithm for the crew scheduling problem. (English) Zbl 1040.90524 Comput. Oper. Res. 25, No. 7-8, 567-582 (1998). MSC: 90B35 90C39 PDFBibTeX XMLCite \textit{J. E. Beasley} and \textit{B. Cao}, Comput. Oper. Res. 25, No. 7--8, 567--582 (1998; Zbl 1040.90524) Full Text: DOI
Sherali, Hanif D.; Lee, Youngho Tighter representations for set partitioning problems. (English) Zbl 0846.90077 Discrete Appl. Math. 68, No. 1-2, 153-167 (1996). MSC: 90C09 90C27 PDFBibTeX XMLCite \textit{H. D. Sherali} and \textit{Y. Lee}, Discrete Appl. Math. 68, No. 1--2, 153--167 (1996; Zbl 0846.90077) Full Text: DOI
Ali, Agha Iqbal; Han, Hyun-Soo; Kennington, Jeffery L. Use of hidden network structure in the set partitioning problem. (English) Zbl 1498.90179 Balas, Egon (ed.) et al., Integer programming and combinatorial optimization. 4th international IPCO conference, Copenhagen, Denmark, May 29–31, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 920, 172-184 (1995). MSC: 90C27 90C10 PDFBibTeX XMLCite \textit{A. I. Ali} et al., Lect. Notes Comput. Sci. 920, 172--184 (1995; Zbl 1498.90179) Full Text: DOI
Lee, Youngho; Sherali, Hanif D. Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem. (English) Zbl 0812.90067 Ann. Oper. Res. 50, 339-365 (1994). MSC: 90B35 90C10 90C05 PDFBibTeX XMLCite \textit{Y. Lee} and \textit{H. D. Sherali}, Ann. Oper. Res. 50, 339--365 (1994; Zbl 0812.90067) Full Text: DOI
Noon, Charles E.; You, Guey-Mei; Chan, Thomas J. A fast lower bound for the minimum cost perfect 2-matching linear program. (English) Zbl 0808.90125 Am. J. Math. Manage. Sci. 13, No. 3-4, 357-370 (1993). MSC: 90C35 90C05 PDFBibTeX XMLCite \textit{C. E. Noon} et al., Am. J. Math. Manage. Sci. 13, No. 3--4, 357--370 (1993; Zbl 0808.90125) Full Text: DOI