Knapsack

Knapsack problems 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 336 articles , 3 standard articles )

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

1 2 3 ... 15 16 17 next

  1. Blado, Daniel; Hu, Weihong; Toriello, Alejandro: Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes (2016)
  2. Caprara, Alberto; Carvalho, Margarida; Lodi, Andrea; Woeginger, Gerhard J.: Bilevel knapsack with interdiction constraints (2016)
  3. Caprara, Alberto; Furini, Fabio; Malaguti, Enrico; Traversi, Emiliano: Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation (2016)
  4. Chen, Danny Z.; Li, Jian; Liang, Hongyu; Wang, Haitao: Matroid and knapsack center problems (2016)
  5. Cunha, Jesus Ossian; Simonetti, Luidi; Lucena, Abilio: Lagrangian heuristics for the quadratic knapsack problem (2016)
  6. Han, Jinil; Lee, Kyungsik; Lee, Chungmok; Choi, Ki-Seok; Park, Sungsoo: Robust optimization approach for a chance-constrained binary knapsack problem (2016)
  7. Jansen, K.; Land, F.; Land, K.: Bounding the running time of algorithms for scheduling and packing problems (2016)
  8. Aardal, Karen; van den Berg, Pieter L.; Gijswijt, Dion; Li, Shanfei: Approximation algorithms for hard capacitated $k$-facility location problems (2015)
  9. Azad, Md.Abul Kalam; Rocha, Ana Maria A.C.; Fernandes, Edite M.G.P.: Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm (2015)
  10. Balogh, János; Békési, József; Dósa, György; Epstein, Leah; Kellerer, Hans; Levin, Asaf; Tuza, Zsolt: Offline black and white bin packing (2015)
  11. Chen, Yuning; Hao, Jin-Kao: Iterated responsive threshold search for the quadratic multiple knapsack problem (2015)
  12. Fomeni, Franklin Djeumou; Kaparis, Konstantinos; Letchford, Adam N.: Cutting planes for RLT relaxations of mixed 0-1 polynomial programs (2015)
  13. Furini, Fabio; Iori, Manuel; Martello, Silvano; Yagiura, Mutsunori: Heuristic and exact algorithms for the interval $\min$-$\max$ regret knapsack problem (2015)
  14. Györgyi, Péter; Kis, Tamás: Reductions between scheduling problems with non-renewable resources and knapsack problems (2015)
  15. Martinelli, Rafael; Contardo, Claudio: Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure (2015)
  16. Patvardhan, C.; Bansal, Sulabh; Srivastav, A.: Solving the 0-1 quadratic knapsack problem with a competitive quantum inspired evolutionary algorithm (2015)
  17. Prékopa, András; Unuvar, Merve: Single commodity stochastic network design under probabilistic constraint with discrete random variables (2015)
  18. Range, Troels Martin; Lusby, Richard Martin; Larsen, Jesper: Solving the selective multi-category parallel-servicing problem (2015)
  19. Reilly, Charles H.; Sapkota, Nabin: A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances (2015)
  20. Rostami, Borzou; Malucelli, Federico: Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation (2015)

1 2 3 ... 15 16 17 next