„knapsack problem“

Suchergebnisse

378 Treffer

• A self-adaptive arithmetic optimization algorithm with hybrid search modes for 0–1 knapsack problem
  Lu, Mengdie ; Lu, Haiyan ; Hou, Xinyu ; Hu, Qingyuan
• An enhanced multi-operator differential evolution algorithm for tackling knapsack optimization problem
  Sallam, Karam M. ; Abohany, Amr A. ; Rizk-Allah, Rizk M.
• TMHSCA: a novel hybrid two-stage mutation with a sine cosine algorithm for discounted {0-1} knapsack problems
  Kang, Yan ; Wang, Haining ; Pu, Bin ; Liu, Jiansong ; Lee, Shin-Jye ; Yang, Xuekun ; Tao, Liu
• A special 0-1 Knapsack problem for a small vegetable retailing system under fuzziness: a swarm optimization based approach
  Acharyya, Samiran ; Changdar, Chiranjit ; Nandi, Utpal
• Reducing the complexity of the knapsack linear integer problem by reformulation techniques
  Munapo, Elias ; Kumar, Santosh
• Solving 0–1 knapsack problem by binary flower pollination algorithm
  Abdel-Basset, Mohamed ; El-Shahat, Doaa ; El-Henawy, Ibrahim
• Sharper p-Values for Stratified Election Audits
  Higgins, Michael J. ; Rivest, Ronald L. ; Stark, Philip B.
• A tree search algorithm for solving the container loading problem
  Fanslau, Tobias ; Bortfeldt, Andreas 2008 FernUniversität in Hagen
• Algorithms for Municipal Flood Mitigation, Related Interdiction Problems, and Knapsack Problems
  Boeckmann, Jan ; Thielen, Clemens ; Wiese, Andreas 2023 Universitätsbibliothek der TU München
• Methodik für einen digitalen Verbesserungsprozess im betrieblichen KVP – Entwicklung und problemorientierte Validierung
  Hambach, Jens 2019 Shaker
• On Algorithms for Multidimensional Packing Problems and on the Complexity of higher dimensional Knapsack
  Grage, Kilian ; Jansen, Klaus ; Megow, Nicole 2024 Universitätsbibliothek Kiel
• On the knapsack problem and semilinear sets
  Figelius, Michael ; Lohrey, Markus 2024 Universitätsbibliothek der Universität Siegen
• Integer Programming and Combinatorial Optimization – 16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings
  Goemans, Michel X. ; Correa, José 2013 Springer Berlin Heidelberg
• Algorithms and complexity results for the 0–1 knapsack problem with group fairness
  Malaguti, Enrico ; Paronuzzi, Paolo ; Santini, Alberto
• Bi-objective knapsack problem with conflicts
  Granata, Donatella ; Raiconi, Andrea
• Comparison of Multiobjective Memetic Algorithms on 0/1 Knapsack Problems
  Ishibuchi, Hisao ; Kaige, Shiori 2003 Universitätsbibliothek Tübingen
• A tale of two packing problems – improved algorithms and tighter bounds for online bin packing and the geometric knapsack problem
  Heydrich, Sandy ; Stee, Rob ˜vanœ 2018 Saarländische Universitäts- und Landesbibliothek
• New Perspectives on Multi-Objective Knapsack Problems
  Schulze, Britta 2017 Universitätsbibliothek Wuppertal
• Multiple Objective Optimization and Implications for Single Objective Optimization
  Gorski, Jochen 2010 Shaker
• Correction to: An integrated ILS-VND strategy for solving the knapsack problem with forfeits
  Vieira, Matheus M. ; Nogueira, Bruno ; Pinheiro, Rian G. S.