1 |
R.E. Marsten, "An Algorithm for Large Set Partitioning Problem," Management Science, Vol. 20, No. 5, pp.774-787, Jan. 1974.
DOI
ScienceOn
|
2 |
K.L. Hoffman, and M. Padberg, "Solving Airline Crew Scheduling Problems by Branch-and-cut," Management Science, Vol. 39, No. 6, pp.657-682, June 1993.
DOI
ScienceOn
|
3 |
D. Bredstrom, K. Jornsten, M. Ronnqvist, and M. Bouchard, "Searching for Optimal Integer Solutions to Set Partitioning Problems using Column Generation," International Transactions in Operational Research, Vol. 21, No. 2, pp.117-197, March 2014.
|
4 |
P.C. Chu, and J.E. Beasley, "Constraint Handling in Genetic Algorithms: The Set Partitioning Problem," Journal of Heuristics, Vol. 4, No. 4, pp.323-357, Dec. 1998.
DOI
|
5 |
B. Crawford, R. Soto, E. Monfroy, et al., "A Hybrid Soft Computing Approach for Subset Problems," Mathematical Problems in Engineering, Vol. 2013, Article ID 716069, 12 pages, June 2013.
|
6 |
C.A. Lin, "Generational Model Genetic Algorithm for Real World Set Partitioning Problems," International Journal of Electronic Commerce Studies, Vol. 4, No. 1, pp.33-46, June 2013.
DOI
|
7 |
J. Hwang, "Integer Programming-based Local Search Techniques for the Multidimensional Knapsack Problem", Journal of The Korea Society of Computer and Information, Vol. 17, No. 6, pp. 13-27, June 2012.
DOI
|
8 |
J. Hwang, "An Integer Programming-based Local Search for the Set Covering Problem", Journal of The Korea Society of Computer and Information, Vol. 19, No. 10, pp. 13-21, Oct. 2014.
DOI
ScienceOn
|
9 |
A. Erera, M. Hewitt, M. Savelsbergh, and Y. Zhang, "Improved Load Plan Design Through Integer Programming Based Local Search," Transportation Science, Vol. 47, No. 3, pp.412-427, Nov. 2012.
DOI
|
10 |
K. Genova, and V. Guliashki, "Linear Integer Programming Methods and Approaches-A Survey," Cybernetics And Information Technologies, Vol. 11, No. 1, pp.3-25, 2011.
|
11 |
J. E. Beasley, "OR-Library: Distributing Test Problems by Electronic Mail," The Journal of the Operational Research Society, Vol. 41, No. 11, pp. 1069-1072, 1990.
DOI
|