• Knapsack

  • Referenced in 488 articles [sw04723]
  • Knapsack problems are the simplest NP-hard problems in combinatorial optimization, as they maximize ... variants of the classical 0-1 knapsack problem will be considered with respect to relaxations...
  • MULKNAP

  • Referenced in 37 articles [sw06467]
  • algorithm for the budget-constrained multiple knapsack problem This paper is concerned with a variant ... multiple knapsack problem (MKP), where knapsacks are available by paying certain `costs’, and we have ... fixed budget to buy these knapsacks. Then, the problem is to determine ... solve test problems with up to 160,000 items and 150 knapsacks within...
  • MOTGA

  • Referenced in 18 articles [sw02666]
  • based genetic algorithm for the multidimensional knapsack problem. A new multiobjective genetic algorithm based ... nondominated solution set of the multiobjective problem. The algorithm performs several stages, each one intended ... designed to the multiobjective multidimensional 0/1 knapsack problem, for which a dedicated routine to repair...
  • azove

  • Referenced in 12 articles [sw04634]
  • investigation of the structure of these problems raises the following tasks: count or enumerate ... algorithm is capable of solving knapsack problems, subset sum problems and multidimensional knapsack problems...
  • JCLEC

  • Referenced in 16 articles [sw08869]
  • study: the resolution of the 0/1 knapsack problem by means of evolutionary algorithms...
  • Algorithm 37

  • Referenced in 10 articles [sw25820]
  • solution of the 0-1 single Knapsack problem. The FORTRAN implementation of an efficient algorithm ... which solves the 0–1 single knapsack problem is given. Computational results are presented, showing...
  • NAPHEAP

  • Referenced in 11 articles [sw23701]
  • algorithm for the separable convex quadratic knapsack problem. This article considers the problem of minimizing ... convex, separable quadratic function subject to a knapsack constraint and a box constraint. An algorithm ... NAPHEAP has been developed to solve this problem. The algorithm solves the Karush-Kuhn-Tucker...
  • OPT4J

  • Referenced in 8 articles [sw07054]
  • comprise ZDT, DTLZ, WFG, and the knapsack problem. The goal of Opt4J is to simplify...
  • mkc7

  • Referenced in 4 articles [sw06171]
  • column-generation approach to the multiple knapsack problem with color constraints We study ... problem that we refer to as the multiple knapsack with color constraints (MKCP). Motivated ... formulated by generalizing the multiple knapsack problem. A real-life instance (called mkc) of this...
  • Algorithm 632

  • Referenced in 3 articles [sw23775]
  • program for the 0-1 multiple knapsack problem. Given n items, each having a profit ... weight w j , and m containers (knapsacks), each having a capacity ... multiple knapsack problem can be informally described as that of assigning items to the knapsacks ... knapsacks or rejected. The paper presents a program to solve the problem through a particular...
  • ToOLS

  • Referenced in 4 articles [sw21244]
  • problem with time windows and a knapsack problem. Several partial and hybrid search methods...
  • MEMOTS

  • Referenced in 4 articles [sw02754]
  • show on the multidimensional multiobjective knapsack problem that if the number of objectives increase...
  • SAC94

  • Referenced in 3 articles [sw32981]
  • SAC94 suite: Collection of multiple knapsack problems...
  • GKNAP

  • Referenced in 1 article [sw30687]
  • package for solving the multidimensional knapsack problem. A genetic algorithm implementation for the multidimensional knapsack ... problem. The multi-constraint (or multidimensional) knapsack problem is a generalization of the 0/1 knapsack ... problem. The multi-constraint knapsack problem has m constraints and one objective function...
  • FLSSS

  • Referenced in 1 article [sw19811]
  • Solver and Extension to General-Purpose Knapsack Problem. A novel algorithm for solving the subset ... problem with bounded error in multidimensional real domain ... application to the general-purpose knapsack problem...
  • PyQUBO

  • Referenced in 1 article [sw37559]
  • with applications in the number partitioning problem, knapsack problem, graph coloring problem, and integer factorization...
  • nilde

  • Referenced in 1 article [sw40073]
  • solving 0-1, bounded and unbounded knapsack problems; 0-1, bounded and unbounded subset...
  • DHLO

  • Referenced in 1 article [sw18810]
  • CEC05 benchmark functions as well as knapsack problems, and its performance is compared with...
  • OR-Gym

  • Referenced in 2 articles [sw34774]
  • operations research problems. In this paper, we apply reinforcement learning to the knapsack, multi-dimensional ... chain, and multi-period asset allocation model problems, as well as benchmark the RL solutions...
  • onerow

  • Referenced in 2 articles [sw31758]
  • generate cutting planes for general mixed-integer problems. We first consider the case ... This relaxation is related to a simple knapsack set with two integer variables...