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

An exact algorithm for large multiple knapsack problems

Citations

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


Cited by:

  1. Simon, Jay & Apte, Aruna & Regnier, Eva, 2017. "An application of the multiple knapsack problem: The self-sufficient marine," European Journal of Operational Research, Elsevier, vol. 256(3), pages 868-876.
  2. Peng Wu & Junheng Cheng & Feng Chu, 2021. "Large-scale energy-conscious bi-objective single-machine batch scheduling under time-of-use electricity tariffs via effective iterative heuristics," Annals of Operations Research, Springer, vol. 296(1), pages 471-494, January.
  3. Ang, James S.K. & Cao, Chengxuan & Ye, Heng-Qing, 2007. "Model and algorithms for multi-period sea cargo mix problem," European Journal of Operational Research, Elsevier, vol. 180(3), pages 1381-1393, August.
  4. Zhen, Lu & Wang, Kai & Wang, Shuaian & Qu, Xiaobo, 2018. "Tug scheduling for hinterland barge transport: A branch-and-price approach," European Journal of Operational Research, Elsevier, vol. 265(1), pages 119-132.
  5. Dell’Amico, Mauro & Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2019. "Mathematical models and decomposition methods for the multiple knapsack problem," European Journal of Operational Research, Elsevier, vol. 274(3), pages 886-899.
  6. Kubat, Peter & Smith, J. MacGregor, 2001. "A multi-period network design problem for cellular telecommunication systems," European Journal of Operational Research, Elsevier, vol. 134(2), pages 439-456, October.
  7. Pawlak, Tomasz P., 2026. "Design flaws in the Polish science quality evaluation system: A technical analysis of latent properties," Journal of Informetrics, Elsevier, vol. 20(1).
  8. M Hifi & M Michrafy & A Sbihi, 2004. "Heuristic algorithms for the multiple-choice multidimensional knapsack problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1323-1332, December.
  9. Alex Fukunaga, 2011. "A branch-and-bound algorithm for hard multiple knapsack problems," Annals of Operations Research, Springer, vol. 184(1), pages 97-119, April.
  10. Tomohiko Mizutani & Makoto Yamashita, 2013. "Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables," Journal of Global Optimization, Springer, vol. 56(3), pages 1073-1100, July.
  11. Kataoka, Seiji & Yamada, Takeo, 2014. "Upper and lower bounding procedures for the multiple knapsack assignment problem," European Journal of Operational Research, Elsevier, vol. 237(2), pages 440-447.
  12. Martello, Silvano & Monaci, Michele, 2020. "Algorithmic approaches to the multiple knapsack assignment problem," Omega, Elsevier, vol. 90(C).
  13. Olivier Lalonde & Jean-François Côté & Bernard Gendron, 2022. "A Branch-and-Price Algorithm for the Multiple Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3134-3150, November.
  14. Zhenbo Wang & Wenxun Xing, 2009. "A successive approximation algorithm for the multiple knapsack problem," Journal of Combinatorial Optimization, Springer, vol. 17(4), pages 347-366, May.
  15. Stefan Hajkowicz & Andrew Higgins & Kristen Williams & Daniel P. Faith & Michael Burton, 2007. "Optimisation and the selection of conservation contracts," Australian Journal of Agricultural and Resource Economics, Australian Agricultural and Resource Economics Society, vol. 51(1), pages 39-56, March.
  16. Mhand Hifi & Hedi Mhalla & Slim Sadfi, 2005. "Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem," Journal of Combinatorial Optimization, Springer, vol. 10(3), pages 239-260, November.
  17. Yang, Zhen & Chen, Haoxun & Chu, Feng & Wang, Nengmin, 2019. "An effective hybrid approach to the two-stage capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 275(2), pages 467-480.
  18. David Bergman, 2019. "An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating," INFORMS Journal on Computing, INFORMS, vol. 31(3), pages 477-492, July.
  19. Wascher, Gerhard & Hau[ss]ner, Heike & Schumann, Holger, 2007. "An improved typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1109-1130, December.
  20. Karel Ječmen & Denisa Mocková & Dušan Teichmann, 2024. "Solving Transport Infrastructure Investment Project Selection and Scheduling Using Genetic Algorithms," Mathematics, MDPI, vol. 12(19), pages 1-28, September.
  21. Soma, Nei Yoshihiro & Toth, Paolo, 2002. "An exact algorithm for the subset sum problem," European Journal of Operational Research, Elsevier, vol. 136(1), pages 57-66, January.
  22. Zheng Wang & Wei Xu & Xiangpei Hu & Yong Wang, 2022. "Inventory allocation to robotic mobile-rack and picker-to-part warehouses at minimum order-splitting and replenishment costs," Annals of Operations Research, Springer, vol. 316(1), pages 467-491, September.
  23. Yamada, Takeo & Takeoka, Takahiro, 2009. "An exact algorithm for the fixed-charge multiple knapsack problem," European Journal of Operational Research, Elsevier, vol. 192(2), pages 700-705, January.
  24. Emde, Simon & Tudoran, Ana Alina, 2025. "The first mile is the hardest: A deep learning-assisted matheuristic for container assignment in first-mile logistics," European Journal of Operational Research, Elsevier, vol. 324(1), pages 335-350.
  25. Geir Dahl & Njål Foldnes, 2006. "LP based heuristics for the multiple knapsack problem with assignment restrictions," Annals of Operations Research, Springer, vol. 146(1), pages 91-104, September.
  26. Mancini, Simona & Ciavotta, Michele & Meloni, Carlo, 2021. "The Multiple Multidimensional Knapsack with Family-Split Penalties," European Journal of Operational Research, Elsevier, vol. 289(3), pages 987-998.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.