1 |
S. Russell, and P. Norvig, "Artificial Intelligence: A Modern Approach," Prentice Hall, pp. 115-116, 2005.
|
2 |
"IBM ILOG CPLEX V12.1: User's Manual for CPLEX," International Business Machines Corporation, 2009.
|
3 |
J. Hwang, and S. Kim, "Integer Programming-based Local Search Technique for Linear Constraint Satisfaction Optimization Problem," Journal of The Korea Society of Computer and Information, Vol. 15, No. 9, pp. 47-55, Sep. 2010.
과학기술학회마을
DOI
|
4 |
J. Puchinger, G. R. Raidl, and U. Pferschy, "The Multidimensional Knapsack problem: Structure and Algorithms," INFORMS Journal on Computing, Vol. 22, No. 2, pp. 250-265, Spring 2010.
DOI
ScienceOn
|
5 |
P. C. Chu, and J. E. Beasley, "A Genetic Algorithm for the Multidimensional Knapsack Problem," Journal of Heuristics, Vol. 4, No. 1, pp. 63-86, 1998.
DOI
|
6 |
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
|
7 |
C. Wilbaut, and S. Hanafi, "New Convergent Heuristics for 0-1 Mixed Integer Programming," European Journal of Operational Research, Vol. 195, No. 1, pp. 62-74, May 2009.
DOI
ScienceOn
|
8 |
S. Boussier, M. Vasquez, Y. Vimont, S. Hanafi, and P. Michelon, "Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search," VI ALIO/EURO Workshop on Applied Combinatorial Optimization, May 2009.
|
9 |
S. Boussier, M. Vasquez, Y. Vimont, S. Hanafi, and P. Michelon, "A Multi-level Search Strategy for the 0-1 Multidimensional Knapsack Problem," Discrete Applied Mathematics, Vol. 158, No. 2, pp. 97-109, Jan. 2010.
DOI
ScienceOn
|
10 |
M. Vasquez, and Y. Vimont, "Improved Results on the 0-1 Multidimensional Knapsack Problem," European Journal of Operational Research, Vol. 165, No. 1, pp. 70-81, August 2005.
DOI
ScienceOn
|
11 |
F. Della Croce, and A. Grosso, "Improved Core Problem based Heuristics for the 0/1 Multidimensional Knapsack Problem," Computers & Operations Research, Vol. 39, No. 1, pp. 27-31, Jan. 2012.
DOI
ScienceOn
|
12 |
F. Glover, and M. Laguna, "Tabu search," Kluwer Academic Publishers, pp. 1-57, 1997.
|
13 |
S. Hasegawa, and Y. Kosugi, "Solving Nurse Scheduling Problem by Integer-programming-based Local Search," 2006 IEEE International Conference on Systems, Man and Cybernetics, pp. 1474-1480, Oct. 2006.
|
14 |
N. Mladenovic, J. Brimberg, P. Hansen and J. A. Moreno Perez, "The p-median Problem: A Survey of Metaheuristic Approaches," European Journal of Operational Research, Vol. 179, No. 3, pp. 927-939, June 2007.
DOI
ScienceOn
|
15 |
M. Diaby, "The Traveling Salesman Problem: A Linear Programming Formulation," WSEAS Transactions on Mathematics, Vol. 6, No. 6, pp. 745-754, May 2007.
|
16 |
J. Hwang, and K. R. Ryu, "A Hybrid of Neighborhood Search and Integer Programming for Crew Schedule Optimization," Journal of KISS : Software and Applications, Vol. 31, No. 6, pp. 829-839, June 2004.
과학기술학회마을
|
17 |
M. Hewitt, G. L. Nemhauser, and M. W. Savelsbergh, "Combining Exact and Heuristic Approaches for the Capacitated Fixed Charge Network Flow Problem," INFORMS Journal on Computing, Vol. 22, No. 2, pp. 314-325, Spring 2010.
DOI
ScienceOn
|
18 |
L. A. Wolsey, "Integer Programming," Wiley, pp. 91-111, 1998.
|
19 |
J. Hwang, S. Park, and I. Y. Kong, "An Integer Programming-based Local Search for Large-scale Multidimensional Knapsack Problems," International Journal on Computer Science and Engineering, Vol. 3, No. 6, pp. 2257-2264, June 2011.
|
20 |
J. Hwang, and S. Kim, "An Integer Programming-based Local Search for Large-scale Maximal Covering Problems," International Journal on Computer Science and Engineering, Vol. 3, No. 2, pp. 837-843, Feb. 2011.
|
21 |
J. E. Beasley, "A Lagrangian Heuristic for Set Covering Problems," Naval Research Logistics, Vol. 37, No. 1, pp. 151-164, Feb. 1990.
DOI
|