„knapsack problem“

Suchergebnisse

1.000+ Treffer

• Multi-strategy monarch butterfly optimization algorithm for discounted {0-1} knapsack problem
  Feng, Yanhong ; Wang, Gai-Ge ; Li, Wenbin ; Li, Ning
• Solving 0–1 Knapsack Problem using Cohort Intelligence Algorithm
  Kulkarni, Anand J. ; Shabir, Hinna
• GPS: a constraint-based gene position procurement in chromosome for solving large-scale multiobjective multiple knapsack problems
  Manicassamy, Jayanthi ; Karunanidhi, Dinesh ; Pothula, Sujatha ; Thirumal, Vengattaraman ; Ponnurangam, Dhavachelvan ; Ramalingam, Subramanian
• 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
• Solving 0–1 knapsack problem by a novel binary monarch butterfly optimization
  Feng, Yanhong ; Wang, Gai-Ge ; Deb, Suash ; Lu, Mei ; Zhao, Xiang-jun
• Modified PSO Based on BVA Techniques
  Raju Govindaraj, Babukarthik 2017 LAP LAMBERT Academic Publishing
• Online Simple Knapsack with Reservation Costs
  Böckenhauer, Hans-Joachim ; Burjons, Elisabet ; Hromkovič, Juraj ; Lotze, Henri ; Rossmanith, Peter 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• 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.
• Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically
  Buchem, Moritz ; Deuker, Paul ; Wiese, Andreas 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time
  Eberle, Franziska ; Megow, Nicole ; Nölke, Lukas ; Simon, Bertrand ; Wiese, Andreas 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• 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
• A Parameterized Approximation Scheme for the Geometric Knapsack Problem with Wide Items
  Mari, Mathieu ; Picavet, Timothé ; Pilipczuk, Michał 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximation algorithms for the generalized incremental knapsack problem
  Faenza, Yuri ; Segev, Danny ; Zhang, Lingyi
• Optimization algorithms for the disjunctively constrained knapsack problem
  Ben Salem, Mariem ; Taktak, Raouia ; Mahjoub, Ali Ridha ; Ben Abdallah, Hanêne
• The binary crayfish optimization algorithm with bitwise operator and repair method for 0–1 knapsack problems: an improved model
  Bas, Emine ; Guner, Lütfi Batuhan