Knapsack problems are the simplest NP-hard problems in combinatorial optimization, as they maximize an objective function subject to a single resource constraint. Several variants of the classical 0-1 knapsack problem will be considered with respect to relaxations, bounds, reductions and other algorithmic techniques for the exact solution. Computational results are presented to compare the actual performance of the most effective algorithms published.

References in zbMATH (referenced in 488 articles , 3 standard articles )

Showing results 1 to 20 of 488.
Sorted by year (citations)

1 2 3 ... 23 24 25 next

  1. Adouani, Yassine; Jarboui, Bassem; Masmoudi, Malek: A matheuristic for the 0--1 generalized quadratic multiple knapsack problem (2022)
  2. Chan, Timothy M.; He, Qizheng: More on change-making and related problems (2022)
  3. El Hajj, Hussein; Bish, Douglas R.; Bish, Ebru K.: Optimal genetic screening for cystic fibrosis (2022)
  4. Rotaru, Dragos; Smart, Nigel P.; Tanguy, Titouan; Vercauteren, Frederik; Wood, Tim: Actively secure setup for SPDZ (2022)
  5. Cerqueira, Gonçalo R. L.; Aguiar, Sérgio S.; Marques, Marlos: Modified greedy heuristic for the one-dimensional cutting stock problem (2021)
  6. Chen, Liang; Chen, Wei-Kun; Yang, Mu-Ming; Dai, Yu-Hong: An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron (2021)
  7. Christensen, Tue Rauff Lind; Klose, Andreas: A fast exact method for the capacitated facility location problem with differentiable convex production costs (2021)
  8. Coniglio, Stefano; Furini, Fabio; San Segundo, Pablo: A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (2021)
  9. Dahmani, Isma; Hifi, Mhand: A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs (2021)
  10. Derpich, Ivan; Herrera, Carlos; Sepúlveda, Felipe; Ubilla, Hugo: Complexity indices for the multidimensional knapsack problem (2021)
  11. Di Francesco, Massimo; Gaudioso, Manlio; Gorgone, Enrico; Murthy, Ishwar: A new extended formulation with valid inequalities for the capacitated concentrator location problem (2021)
  12. Galli, Laura; Martello, Silvano; Rey, Carlos; Toth, Paolo: Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem (2021)
  13. Garcia, Stephan Ramon; Omar, Mohamed; O’Neill, Christopher; Yih, Samuel: Factorization length distribution for affine semigroups. II: Asymptotic behavior for numerical semigroups with arbitrarily many generators (2021)
  14. Gläser, Sina; Stücken, Mareike: Introduction of an underground waste container system-model and solution approaches (2021)
  15. Korneenko, V. P.: An efficient algorithm of dead-end controls for solving combinatorial optimization problems (2021)
  16. Mancini, Simona; Ciavotta, Michele; Meloni, Carlo: The multiple multidimensional knapsack with family-split penalties (2021)
  17. Oliveira, Óscar; Matos, Telmo; Gamboa, Dorabela: A dual RAMP algorithm for single source capacitated facility location problems (2021)
  18. Pessoa, Artur; Sadykov, Ruslan; Uchoa, Eduardo: Solving bin packing problems using VRPSolver models (2021)
  19. Pimenta-Zanon, M. H.; Sakuray, F.; Hoto, R. S. V.: A heuristic for the problem of one-dimensional steel coil cutting (2021)
  20. Puerto, Justo; Ricca, Federica; Scozzari, Andrea: Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem (2021)

1 2 3 ... 23 24 25 next