IDEAS home Printed from https://ideas.repec.org/r/eee/ejores/v82y1995i1p176-189.html

Tabu search for the multilevel generalized assignment problem

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Yagiura, Mutsunori & Ibaraki, Toshihide & Glover, Fred, 2006. "A path relinking approach with ejection chains for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 169(2), pages 548-569, March.
  2. Rohit Ramachandran & Urjit Patil & Abhinav De, 2026. "(Pareto)-Optimization and greedy algorithm-based solutions for review and panel assignments," Journal of Combinatorial Optimization, Springer, vol. 51(2), pages 1-38, March.
  3. Woodcock, Andrew J. & Wilson, John M., 2010. "A hybrid tabu search/branch & bound approach to solving the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 207(2), pages 566-578, December.
  4. Alberto Ceselli & Giovanni Righini, 2006. "A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem," Operations Research, INFORMS, vol. 54(6), pages 1172-1184, December.
  5. Helena Ramalhinho-Lourenço & Daniel Serra, 1998. "Adaptive approach heuristics for the generalized assignment problem," Economics Working Papers 288, Department of Economics and Business, Universitat Pompeu Fabra.
  6. Mutsunori Yagiura & Toshihide Ibaraki & Fred Glover, 2004. "An Ejection Chain Approach for the Generalized Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 133-151, May.
  7. A Hertz & N Lahrichi, 2009. "A patient assignment algorithm for home care services," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(4), pages 481-495, April.
  8. Gelareh, Shahin & Glover, Fred & Guemri, Oualid & Hanafi, Saïd & Nduwayo, Placide & Todosijević, Raca, 2020. "A comparative study of formulations for a cross-dock door assignment problem," Omega, Elsevier, vol. 91(C).
  9. Mattfeld, D. C. & Kopfer, H., 2003. "Terminal operations management in vehicle transshipment," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(5), pages 435-452, June.
  10. Mikhail A. Bragin & Peter B. Luh & Joseph H. Yan & Nanpeng Yu & Gary A. Stern, 2015. "Convergence of the Surrogate Lagrangian Relaxation Method," Journal of Optimization Theory and Applications, Springer, vol. 164(1), pages 173-201, January.
  11. Sexton, Randall S. & Alidaee, Bahram & Dorsey, Robert E. & Johnson, John D., 1998. "Global optimization for artificial neural networks: A tabu search application," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 570-584, April.
  12. Martí, Rafael & Sevaux, Marc & Sörensen, Kenneth, 2025. "Fifty years of metaheuristics," European Journal of Operational Research, Elsevier, vol. 321(2), pages 345-362.
  13. Tzur, Michal & Drezner, Ehud, 2011. "A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system," European Journal of Operational Research, Elsevier, vol. 215(2), pages 325-336, December.
  14. Diaz, Juan A. & Fernandez, Elena, 2001. "A Tabu search heuristic for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 132(1), pages 22-38, July.
  15. Osorio, Maria A. & Laguna, Manuel, 2003. "Logic cuts for multilevel generalized assignment problems," European Journal of Operational Research, Elsevier, vol. 151(1), pages 238-246, November.
  16. Jeet, V. & Kutanoglu, E., 2007. "Lagrangian relaxation guided problem space search heuristics for generalized assignment problems," European Journal of Operational Research, Elsevier, vol. 182(3), pages 1039-1056, November.
  17. G. Hernández-Díaz, Alfredo & Guerrero Casas, Flor M. & Caballero Fernández, Rafael & Molina Luque, Julián, 2006. "Algoritmo Tabú para un problema de distribución de espacios = Tabu Search Algorithm for a Room Allocation Problem," Revista de Métodos Cuantitativos para la Economía y la Empresa = Journal of Quantitative Methods for Economics and Business Administration, Universidad Pablo de Olavide, Department of Quantitative Methods for Economics and Business Administration, vol. 1(1), pages 25-37, June.
  18. Robert M. Nauss, 2003. "Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 249-266, August.
  19. Rego, Cesar, 1998. "Relaxed tours and path ejections for the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 522-538, April.
  20. Amini, Mohammad M. & Racer, Michael & Ghandforoush, Parviz, 1998. "Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study," European Journal of Operational Research, Elsevier, vol. 108(3), pages 604-617, August.
  21. Freville, Arnaud, 2004. "The multidimensional 0-1 knapsack problem: An overview," European Journal of Operational Research, Elsevier, vol. 155(1), pages 1-21, May.
  22. June S. Park & Byung Ha Lim & Youngho Lee, 1998. "A Lagrangian Dual-Based Branch-and-Bound Algorithm for the Generalized Multi-Assignment Problem," Management Science, INFORMS, vol. 44(12-Part-2), pages 271-282, December.
  23. Wei Wu & Manuel Iori & Silvano Martello & Mutsunori Yagiura, 2022. "An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2523-2539, September.
  24. R M Nauss, 2004. "The elastic generalized assignment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1333-1341, December.
  25. Talla Nobibon, Fabrice & Leus, Roel & Spieksma, Frits C.R., 2011. "Optimization models for targeted offers in direct marketing: Exact and heuristic algorithms," European Journal of Operational Research, Elsevier, vol. 210(3), pages 670-683, May.
  26. Mar-Ortiz, Julio & Castillo-García, Norberto & Gracia, María D., 2020. "A decision support system for a capacity management problem at a container terminal," International Journal of Production Economics, Elsevier, vol. 222(C).
  27. Zäpfel, Günther & Bögl, Michael, 2012. "Two heuristic solution concepts for the vehicle selection problem in line haul transports," European Journal of Operational Research, Elsevier, vol. 217(2), pages 448-458.
  28. Samir A. Abass, 2012. "0-1 integer interval number programming approach for the multilevel generalized assignment problem," E3 Journal of Business Management and Economics., E3 Journals, vol. 3(9), pages 326-329.
  29. Malichan Thongkham & Sasitorn Kaewman, 2018. "Methodology to Solve the Combination of the Generalized Assignment Problem and the Vehicle Routing Problem: A Case Study in Drug and Medical Instrument Sales and Service," Administrative Sciences, MDPI, vol. 9(1), pages 1-21, December.
  30. Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
  31. Vié, Marie-Sklaerder & Zufferey, Nicolas & Cordeau, Jean-François, 2019. "Solving the Wire-Harness Design Problem at a European car manufacturer," European Journal of Operational Research, Elsevier, vol. 272(2), pages 712-724.
  32. Elham Moridi & Hamid Barati, 2017. "RMRPTS: a reliable multi-level routing protocol with tabu search in VANET," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 65(1), pages 127-137, May.
  33. Arnaud Fréville & SaÏd Hanafi, 2005. "The Multidimensional 0-1 Knapsack Problem—Bounds and Computational Aspects," Annals of Operations Research, Springer, vol. 139(1), pages 195-227, October.
  34. S Casado & M Laguna & J Pacheco, 2005. "Heuristical labour scheduling to optimize airport passenger flows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(6), pages 649-658, June.
  35. Helena Ramalhinho-Lourenço & Rafael Martí & Manuel Laguna, 2001. "Assigning proctors to exams with scatter search," Economics Working Papers 534, Department of Economics and Business, Universitat Pompeu Fabra.
  36. Hongsheng Zhong & Randolph W. Hall & Maged Dessouky, 2007. "Territory Planning and Vehicle Dispatching with Driver Learning," Transportation Science, INFORMS, vol. 41(1), pages 74-89, February.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.