IDEAS home Printed from https://ideas.repec.org/r/eee/ejores/v123y2000i2p325-332.html
   My bibliography  Save this item

New trends in exact algorithms for the 0-1 knapsack problem

Citations

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


Cited by:

  1. Di Francesco, Massimo & Gaudioso, Manlio & Gorgone, Enrico & Murthy, Ishwar, 2021. "A new extended formulation with valid inequalities for the Capacitated Concentrator Location Problem," European Journal of Operational Research, Elsevier, vol. 289(3), pages 975-986.
  2. Büther, Marcel & Briskorn, Dirk, 2007. "Reducing the 0-1 knapsack problem with a single continuous variable to the standard 0-1 knapsack problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 629, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  3. Reilly, Charles H. & Sapkota, Nabin, 2015. "A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances," European Journal of Operational Research, Elsevier, vol. 241(3), pages 642-652.
  4. 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.
  5. Simon Thevenin & Nicolas Zufferey & Marino Widmer, 2016. "Order acceptance and scheduling with earliness and tardiness penalties," Journal of Heuristics, Springer, vol. 22(6), pages 849-890, December.
  6. Sbihi, Abdelkader, 2010. "A cooperative local search-based algorithm for the Multiple-Scenario Max-Min Knapsack Problem," European Journal of Operational Research, Elsevier, vol. 202(2), pages 339-346, April.
  7. Shah, Ruchit & Reed, Patrick, 2011. "Comparative analysis of multiobjective evolutionary algorithms for random and correlated instances of multiobjective d-dimensional knapsack problems," European Journal of Operational Research, Elsevier, vol. 211(3), pages 466-479, June.
  8. Barbati, Maria & Corrente, Salvatore & Greco, Salvatore, 2020. "A general space-time model for combinatorial optimization problems (and not only)," Omega, Elsevier, vol. 96(C).
  9. Eskigun, Erdem & Uzsoy, Reha & Preckel, Paul V. & Beaujon, George & Krishnan, Subramanian & Tew, Jeffrey D., 2005. "Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers," European Journal of Operational Research, Elsevier, vol. 165(1), pages 182-206, August.
  10. Jayaswal, Sachin, 2016. "Nonlinear 0-1 knapsack problem with capacity selection," IIMA Working Papers WP2016-03-10, Indian Institute of Management Ahmedabad, Research and Publication Department.
  11. 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.
  12. Boyer, V. & Elkihel, M. & El Baz, D., 2009. "Heuristics for the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 199(3), pages 658-664, December.
  13. He, Yichao & Wang, Jinghong & Liu, Xuejing & Wang, Xizhao & Ouyang, Haibin, 2024. "Modeling and solving of knapsack problem with setup based on evolutionary algorithm," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 219(C), pages 378-403.
  14. Felipe Cisternas-Caneo & Broderick Crawford & Ricardo Soto & Giovanni Giachetti & Álex Paz & Alvaro Peña Fritz, 2024. "Chaotic Binarization Schemes for Solving Combinatorial Optimization Problems Using Continuous Metaheuristics," Mathematics, MDPI, vol. 12(2), pages 1-39, January.
  15. Mavrotas, George & Florios, Kostas & Figueira, José Rui, 2015. "An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: A computational study and comparison with meta-heuristics," Applied Mathematics and Computation, Elsevier, vol. 270(C), pages 25-43.
  16. Hajkowicz, Stefan & Higgins, Andrew J. & Williams, Kristen & Faith, Daniel P. & Burton, Michael P., 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 1-18.
  17. Paola Cappanera & Marco Trubian, 2005. "A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 17(1), pages 82-98, February.
  18. R. Pablo Arribillaga & G. Bergantiños, 2022. "Cooperative and axiomatic approaches to the knapsack allocation problem," Annals of Operations Research, Springer, vol. 318(2), pages 805-830, November.
  19. 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.
  20. Syam Menon & Ali Amiri, 2004. "Scheduling Banner Advertisements on the Web," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 95-105, February.
  21. Benati, Stefano, 2004. "The computation of the worst conditional expectation," European Journal of Operational Research, Elsevier, vol. 155(2), pages 414-425, June.
  22. van der Merwe, D.J. & Hattingh, J.M., 2006. "Tree knapsack approaches for local access network design," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1968-1978, November.
  23. Ivan Contreras & Juan A. Díaz & Elena Fernández, 2011. "Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment," INFORMS Journal on Computing, INFORMS, vol. 23(1), pages 41-55, February.
  24. Toth, Paolo, 2000. "Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 125(2), pages 222-238, September.
  25. Peter Lindberg, 2010. "Optimal partial hedging in a discrete-time market as a knapsack problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 72(3), pages 433-451, December.
  26. Lin, Feng-Tse, 2008. "Solving the knapsack problem with imprecise weight coefficients using genetic algorithms," European Journal of Operational Research, Elsevier, vol. 185(1), pages 133-145, February.
  27. Novak, Antonin & Sucha, Premysl & Hanzalek, Zdenek, 2019. "Scheduling with uncertain processing times in mixed-criticality systems," European Journal of Operational Research, Elsevier, vol. 279(3), pages 687-703.
  28. Chen, Kai & Ross, Sheldon M., 2014. "An adaptive stochastic knapsack problem," European Journal of Operational Research, Elsevier, vol. 239(3), pages 625-635.
  29. Wishon, Christopher & Villalobos, J. Rene, 2016. "Robust efficiency measures for linear knapsack problem variants," European Journal of Operational Research, Elsevier, vol. 254(2), pages 398-409.
  30. Genserik L. L. Reniers & Kenneth Sörensen, 2013. "An Approach for Optimal Allocation of Safety Resources: Using the Knapsack Problem to Take Aggregated Cost‐Efficient Preventive Measures," Risk Analysis, John Wiley & Sons, vol. 33(11), pages 2056-2067, November.
  31. 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.
  32. Akinc, Umit, 2006. "Approximate and exact algorithms for the fixed-charge knapsack problem," European Journal of Operational Research, Elsevier, vol. 170(2), pages 363-375, April.
  33. Charles H. Reilly, 2009. "Synthetic Optimization Problem Generation: Show Us the Correlations!," INFORMS Journal on Computing, INFORMS, vol. 21(3), pages 458-467, August.
  34. Joonyup Eun & Chang Sup Sung & Eun-Seok Kim, 2017. "Maximizing total job value on a single machine with job selection," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(9), pages 998-1005, September.
  35. Ewa M. Bednarczuk & Janusz Miroforidis & Przemysław Pyzel, 2018. "A multi-criteria approach to approximate solution of multiple-choice knapsack problem," Computational Optimization and Applications, Springer, vol. 70(3), pages 889-910, July.
  36. Furini, Fabio & Ljubić, Ivana & Sinnl, Markus, 2017. "An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem," European Journal of Operational Research, Elsevier, vol. 262(2), pages 438-448.
  37. Kohli, Rajeev & Krishnamurti, Ramesh & Mirchandani, Prakash, 2004. "Average performance of greedy heuristics for the integer knapsack problem," European Journal of Operational Research, Elsevier, vol. 154(1), pages 36-45, April.
  38. Ben O’Neill, 2022. "Smallest covering regions and highest density regions for discrete distributions," Computational Statistics, Springer, vol. 37(3), pages 1229-1254, July.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.