Generalized Assignment Problem Dynamic Programming

  • 1.

    Atamtürk, A., Savelsbergh, M.W.P.: Integer-programming software systems. Ann. Oper. Res. 140(1), 67–124 (2005) MathSciNetMATHCrossRefGoogle Scholar

  • 2.

    Avella, P., Boccia, M., Vasilyev, I.: A computational study of exact knapsack separation for the generalized assignment problem. Comput. Optim. Appl. 45(3), 543–555 (2010) MathSciNetMATHCrossRefGoogle Scholar

  • 3.

    Beasley, J.E.: Generalised assignment problem test data sets. http://people.brunel.ac.uk/~mastjjb/jeb/orlib/gapinfo.html

  • 4.

    Diaz, J.A., Fernandez, E.: A tabu search heuristic for the generalized assignment problem. Eur. J. Oper. Res. 132(1), 22–38 (2001) MathSciNetMATHCrossRefGoogle Scholar

  • 5.

    Frangioni, A.: Solving semidefinite quadratic problems within nonsmooth optimization algorithms. Comput. Oper. Res. 23(11), 1099–1118 (1996) MathSciNetMATHCrossRefGoogle Scholar

  • 6.

    Haddadi, S., Ouzia, H.: Effective algorithm and heuristic for the generalized assignment problem. Eur. J. Oper. Res. 153(1), 184–190 (2004) MathSciNetMATHCrossRefGoogle Scholar

  • 7.

    Karabakal, N., Bean, J.C., Lohmann, J.R.: A steepest descent multiplier adjustment method for the generalized assignment problem. Technical report, University of Michigan (1992) Google Scholar

  • 8.

    Nauss, R.M.: Solving the generalized assignment problem: an optimizing and heuristic approach. INFORMS J. Comput. 15(3), 249–266 (2003) MathSciNetMATHCrossRefGoogle Scholar

  • 9.

    Pigatti, A., de Aragao, M.P., Uchoa, E.: Stabilized branch-and-cut-and-price for the generalized assignment problem. Electron. Notes Discrete Math. 5, 389–395 (2005) CrossRefGoogle Scholar

  • 10.

    Pisinger, D.: A minimal algorithm for the 0-1 knapsack problem. Oper. Res. 45(5), 758–767 (1997) MathSciNetMATHCrossRefGoogle Scholar

  • 11.

    Ross, G.T., Soland, R.M.: A branch and bound algorithm for the generalized assignment problem. Math. Program. 8(1), 91–103 (1975) MathSciNetMATHCrossRefGoogle Scholar

  • 12.

    Savelsbergh, M.: A branch-and-price algorithm for the generalized assignment problem. Oper. Res. 45(6), 831–841 (1997) MathSciNetMATHCrossRefGoogle Scholar

  • 13.

    Wolsey, L.A.: Integer Programming. Wiley, New York (1998) MATHGoogle Scholar

  • 14.

    Yagiura, M., Ibaraki, T., Glover, F.: An ejection chain approach for the generalized assignment problem. INFORMS J. Comput. 16(2), 133–151 (2004) MathSciNetMATHCrossRefGoogle Scholar

  • 15.

    Yagiura, M., Ibaraki, T., Glover, F.: A path relinking approach with ejection chains for the generalized assignment problem. Eur. J. Oper. Res. 169(2), 548–569 (2006) MathSciNetMATHCrossRefGoogle Scholar

  • ГЛАВА 128 Когда Сьюзан проснулась, солнце уже светило вовсю. Его нежные лучи проникали сквозь занавеску и падали на пуховую перину.

    Она потянулась к Дэвиду.

    0 comments

    Leave a Reply

    Your email address will not be published. Required fields are marked *