„The Knapsack Problem“

Suchergebnisse

1.000+ Treffer

• A modified nature inspired meta-heuristic whale optimization algorithm for solving 0–1 knapsack problem
  Abdel-Basset, Mohamed ; El-Shahat, Doaa ; Sangaiah, Arun Kumar
• New binary bat algorithm for solving 0–1 knapsack problem
  Rizk-Allah, Rizk M. ; Hassanien, Aboul Ella
• A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem
  Kellerer, Hans ; Pferschy, Ulrich
• Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem
  Alidaee, Bahram ; Ramalingam, Vijay P. ; Wang, Haibo ; Kethley, Bryan
• Approximation of knapsack problems with conflict and forcing graphs
  Pferschy, Ulrich ; Schauer, Joachim
• A quantum algorithm for solving 0-1 Knapsack problems
  Wilkening, Sören ; Lefterovici, Andreea-Iulia ; Binkowski, Lennart ; Perk, Michael ; Fekete, Sándor ; Osborne, Tobias J.
• An Improved Approximation Algorithm for Knapsack Median Using Sparsification
  Byrka, Jarosław ; Pensyl, Thomas ; Rybicki, Bartosz ; Spoerhase, Joachim ; Srinivasan, Aravind ; Trinh, Khoa
• Approximation schemes for r-weighted Minimization Knapsack problems
  Elbassioni, Khaled ; Karapetyan, Areg ; Nguyen, Trung Thanh
• Approximation algorithms for the generalized incremental knapsack problem
  Faenza, Yuri ; Segev, Danny ; Zhang, Lingyi
• A tree search algorithm for solving the container loading problem
  Fanslau, Tobias ; Bortfeldt, Andreas 2008 FernUniversität in Hagen
• On the knapsack problem and semilinear sets
  Figelius, Michael ; Lohrey, Markus 2024 Universitätsbibliothek der Universität Siegen
• 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
• Correction to: An integrated ILS-VND strategy for solving the knapsack problem with forfeits
  Vieira, Matheus M. ; Nogueira, Bruno ; Pinheiro, Rian G. S.
• Exact methods for discrete $${\varGamma }$$ Γ -robust interdiction problems with an application to the bilevel knapsack problem
  Beck, Yasmine ; Ljubić, Ivana ; Schmidt, Martin
• Subsidies, knapsack auctions and Dantzig's greedy heuristic
  Ensthaler, Ludwig ; Giebe, Thomas 2009 Deutsches Institut für Wirtschaftsforschung (DIW)
• Identifying Knapsack Problems with Conflicts that Are Difficult to Solve Optimally Using General-Purpose Integer Programming Software
  Song, Myung Soon ; Lin, Pei Hua ; Lu, Yun ; Vasko, Francis J.
• A 3-space dynamic programming heuristic for the cubic knapsack problem
  Dan Dije, Ibrahim ; Djeumou Fomeni, Franklin ; Coelho, Leandro C.
• An exact approach for the Stackelberg knapsack problem with weight selection
  Lee, Yeonghun ; Seo, Kiho ; Joung, Seulgi ; Park, Sungsoo
• The Complexity of Knapsack Problems in Wreath Products
  Figelius, Michael ; Ganardi, Moses ; Lohrey, Markus ; Zetzsche, Georg 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik