Branch And Bound Assignment Problem And Transportation

  • Asahiro Y, Ishibashi M, Yamashita M (2003) Independent and cooperative parallel search methods for the generalized assignment problem. Optim methods Softw 18(2):129–141MathSciNetCrossRefMATHGoogle Scholar

  • Chu PC, Beasley JE (1997) A genetic algorithm for the generalized assignment problem. Comput Oper Res 24:17–23MathSciNetCrossRefMATHGoogle Scholar

  • Fisher ML, Jaikumar R, Van Wassenhove LN (1986) A multiplier adjustment method for the generalized assignment problem. Manage Sci 32(9):1095–1103CrossRefMATHGoogle Scholar

  • Guignard M, Rosenwein M (1989) An improved dual-based algorithm for the generalized assignment problem. Oper Res 37(4):658–663MathSciNetCrossRefMATHGoogle Scholar

  • Karabakal N, Bean JC, Lohmann JR, (1992) A steepest descent multiplier adjustment method for the generalized assignment problem. Report 92–11, University of Michigan, Ann ArborGoogle Scholar

  • Kumar S, Munapo E, Jones BC (2007) An integer equation controlled descending path to a protean pure integer program. Indian J Math 49:211–237MathSciNetMATHGoogle Scholar

  • Laguna M, Kelly JP, Conzalez-Velarde JL, Glover FF (1995) Tabu search for the generalized assignment problem. Eur J Oper Res 82:176–189CrossRefMATHGoogle Scholar

  • Martello S, Toth P (1981) An algorithm for the generalized Assignment Problem. In: Brans JP (ed) Operations Research 81. North-Holland, Amsterdam, pp 589–603Google Scholar

  • Munapo E, Kumar S, Musekwa SD (2010) A revisit to the generalized assignment problem: an ascending hyper-plane approach through network flows. Int J Manag Prud 1(2):7–14Google Scholar

  • Munapo E, Nyamugure P, Lesaoana M, Kumar S (2012) A note on unified approach to solving the transportation and assignment models in operations research. Int J Math Model Simul Appl 5(2):140–149Google Scholar

  • Nauss RM (2003) Solving the generalized assignment problem: an optimizing heuristic approach. INFORMS J Comp 15(3):249–266MathSciNetCrossRefMATHGoogle Scholar

  • Osman IH (1995) Heuristics for the generalized assignment problem: simulated annealing and tabu search approaches. OR Spektrum 17:211–225CrossRefMATHGoogle Scholar

  • Pigatti A, Poggie De Aragao M, Uchoa E (2005) Stabilized branch and cut and price for the generalized assignment problem. In: 2nd Brazilian symposium on graphs, algorithms and combinatorics. Electronic notes in discrete mathematics, vol 19. Elsevier, Amsterdam, 389–395Google Scholar

  • Ross GT, Soland RM (1975) A branch and bound algorithm for the generalized assignment problem. Math Program 8:91–103MathSciNetCrossRefMATHGoogle Scholar

  • Savelsburgh M (1997) A branch and price algorithm for the generalized assignment problem. Oper Res 45(6):831–841MathSciNetCrossRefGoogle Scholar

  • Toth P, Vigo D (2001) The vehicle routing problem. SIAM monographs on discrete mathematics and applications, PhiladelphiaGoogle Scholar

  • Winston WL, Venkataramanan M (2003) Introduction to mathematical programming, 4th edn. Thomson Brooks/Cole, Pacific GroveGoogle Scholar

  • Yagiura M, Yamaguchi T, Ibaraki T (1998) A variable depth search algorithm with branching search for the generalized assignment problem. Optim Methods Softw 10:419–441MathSciNetCrossRefMATHGoogle Scholar

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

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

  • Беккер шумно вздохнул. Разумеется. Но мне она неизвестна.

    Comments

    Leave a Reply

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