„knapsack problem“

Suchergebnisse

378 Treffer

• Correction to: An enhanced multi-operator differential evolution algorithm for tackling knapsack optimization problem
  Sallam, Karam M. ; Abohany, Amr A. ; Rizk-Allah, Rizk M.
• Correction to: 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
• Erratum to: “Solving the Mixed-Integer Knapsack Problem by Decrease of Dimension and Use of Dynamic Programming”
  Mamedov, K. Sh ; Mamedov, K. K. ; Yolchuyeva, S. K.
• 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)
• An evolutionary algorithm for solving a unique discounted 0-1 knapsack problem in a random type-2 fuzzy environment
  Saha, Subir ; Changdar, Chiranjit ; Giri, Pravash Kumar ; Pal, Rajat Kumar ; Nandi, Utpal
• Algorithms and Data Structures – 15th International Symposium, WADS 2017, St. John’s, NL, Canada, July 31 – August 2, 2017, Proceedings
  Dehne, Frank ; Solis-Oba, Roberto ; Sack, Jörg-Rüdiger 2017 Springer International Publishing
• Knapsack Problems
  2004 Springer Berlin Heidelberg
• Parameterized approximation scheme for the multiple knapsack problem
  Jansen, Klaus 2009 Institut für Informatik / Christian-Albrechts-Universität zu Kiel
• A fast approximation scheme for the multiple knapsack problem
  Jansen, Klaus 2009 Institut für Informatik / Christian-Albrechts-Universität zu Kiel
• The average behaviour of greedy algorithms for the knapsack problem: Computational experiments
  Bank, Bernd ; Diubin, Gennady ; Korbut, Alexander ; Sigal, I. 2005 Humboldt-Universität zu Berlin
• On the average behaviour of greedy algorithms for the knapsack problem
  Diubin, Gennady ; Korbut, Alexander 2005 Humboldt-Universität zu Berlin
• 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.
• Online Knapsack Problems with Estimates
  Balabán, Jakub ; Gehnen, Matthias ; Lotze, Henri ; Seesemann, Finn ; Stocker, Moritz 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Linear and Integer Programming Made Easy
  Hu, T. C. ; Kahng, Andrew B. 2016 Springer International Publishing
• Parallel greedy algorithms for packing unequal spheres into a cuboidal strip or a cuboid
  Kubach, Timo ; Bortfeldt, Andreas ; Tilli, Thomas ; Gehring, Hermann 2009 FernUniversität in Hagen
• A 3-space dynamic programming heuristic for the cubic knapsack problem
  Dan Dije, Ibrahim ; Djeumou Fomeni, Franklin ; Coelho, Leandro C.
• Branch-And-Bound Algorithms as Polynomial-Time Approximation Schemes
  Encz, Koppány István ; Mastrolilli, Monaldo ; Vercesi, Eleonora 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity
  Bansal, Ishan ; Cheriyan, Joe ; Khanna, Sanjeev ; Simmons, Miles 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Energy‐Efficient Knapsack Optimization Using Probabilistic Memristor Crossbars
  Li, Jinzhan ; Kumar, Suhas ; Yi, Su‐in