Articles with "knapsack problem" as a keyword



Photo from wikipedia

Approximation schemes for r-weighted Minimization Knapsack problems

Sign Up to like & get
recommendations!
Published in 2019 at "Annals of Operations Research"

DOI: 10.1007/s10479-018-3111-9

Abstract: Stimulated by salient applications arising from power systems, this paper studies a class of non-linear Knapsack problems with non-separable quadratic constrains, formulated in either binary or integer form. These problems resemble the duals of the… read more here.

Keywords: approximation schemes; knapsack problem; knapsack problems; knapsack ... See more keywords
Photo by gabriellefaithhenderson from unsplash

A k-means binarization framework applied to multidimensional knapsack problem

Sign Up to like & get
recommendations!
Published in 2017 at "Applied Intelligence"

DOI: 10.1007/s10489-017-0972-6

Abstract: The multidimensional knapsack problem (MKP) is one of the widely known integer programming problems. The MKP has received significant attention from the operational research community for its large number of applications. Solving this NP-hard problem… read more here.

Keywords: knapsack problem; framework; means binarization; problem ... See more keywords
Photo from wikipedia

A modified hybrid rice optimization algorithm for solving 0-1 knapsack problem

Sign Up to like & get
recommendations!
Published in 2022 at "Applied Intelligence"

DOI: 10.1007/s10489-021-02717-4

Abstract: The 0-1 knapsack problem (KP) is a classic NP-hard problem and could be handled by swarm intelligence algorithms. However, most of these algorithms might be trapped in the local optima as the scale increases. Hybrid… read more here.

Keywords: knapsack problem; model; optimization; hybrid rice ... See more keywords
Photo by merchusey from unsplash

Approximation of knapsack problems with conflict and forcing graphs

Sign Up to like & get
recommendations!
Published in 2017 at "Journal of Combinatorial Optimization"

DOI: 10.1007/s10878-016-0035-7

Abstract: We study the classical 0–1 knapsack problem with additional restrictions on pairs of items. A conflict constraint states that from a certain pair of items at most one item can be contained in a feasible… read more here.

Keywords: graphs; conflict; knapsack problem; knapsack ... See more keywords
Photo by gabriellefaithhenderson from unsplash

Analysis of Divide-and-Conquer strategies for the 0–1 minimization knapsack problem

Sign Up to like & get
recommendations!
Published in 2020 at "Journal of Combinatorial Optimization"

DOI: 10.1007/s10878-020-00584-2

Abstract: We introduce and asses several Divide-and-Conquer heuristic strategies, aimed at solving large instances of the 0–1 Minimization Knapsack Problem. The method subdivides a large problem in two smaller ones (or recursive iterations of the same… read more here.

Keywords: minimization knapsack; divide conquer; problem; knapsack problem ... See more keywords
Photo from wikipedia

A hybrid grey wolf optimizer for solving the product knapsack problem

Sign Up to like & get
recommendations!
Published in 2021 at "International Journal of Machine Learning and Cybernetics"

DOI: 10.1007/s13042-020-01165-9

Abstract: The product knapsack problem (PKP) is a new variation of the knapsack problem which arises in social choice computation. Although some deterministic algorithms have been reported to handle small-scale problems, the solution to the middle… read more here.

Keywords: product knapsack; grey wolf; problem; knapsack problem ... See more keywords
Photo from wikipedia

Knapsack in hyperbolic groups

Sign Up to like & get
recommendations!
Published in 2020 at "Journal of Algebra"

DOI: 10.1016/j.jalgebra.2019.04.008

Abstract: Abstract Recently knapsack problems have been generalized from the integers to arbitrary finitely generated groups. The knapsack problem for a finitely generated group G is the following decision problem: given a tuple ( g ,… read more here.

Keywords: hyperbolic group; knapsack problem; knapsack; group ... See more keywords
Photo by gabriellefaithhenderson from unsplash

A Generalized Knapsack-Problem Based Decomposition Heuristic for Solving Multistage Stochastic Programs with Endogenous and/or Exogenous Uncertainties

Sign Up to like & get
recommendations!
Published in 2018 at "Industrial & Engineering Chemistry Research"

DOI: 10.1021/acs.iecr.8b00822

Abstract: Optimization problems with decision-dependent (endogenous) and/or decision-independent (exogenous) uncertainties are commonly observed in the process industry, and multistage stochastic programming (MSSP) is one approach for modeling such problems. However, MSSPs grow quickly and become computationally… read more here.

Keywords: knapsack problem; exogenous uncertainties; endogenous exogenous; generalized knapsack ... See more keywords
Photo from wikipedia

Neural Knapsack: A Neural Network Based Solver for the Knapsack Problem

Sign Up to like & get
recommendations!
Published in 2020 at "IEEE Access"

DOI: 10.1109/access.2020.3044005

Abstract: This paper introduces a heuristic solver based on neural networks and deep learning for the knapsack problem. The solver is inspired by mechanisms and strategies used by both algorithmic solvers and humans. The neural model… read more here.

Keywords: neural knapsack; knapsack neural; knapsack problem; knapsack ... See more keywords
Photo from wikipedia

Modified Artificial Bee Colony Algorithm for Multiple-Choice Multidimensional Knapsack Problem

Sign Up to like & get
recommendations!
Published in 2023 at "IEEE Access"

DOI: 10.1109/access.2023.3264966

Abstract: The multiple-choice multidimensional knapsack problem (MMKP) is a well-known NP-hard problem that has many real-time applications. However, owing to its complexity, finding computationally efficient solutions for the MMKP remains a challenging task. In this study,… read more here.

Keywords: problem; multidimensional knapsack; modified artificial; choice multidimensional ... See more keywords
Photo from wikipedia

On Combinatorial Properties of the Knapsack Problem

Sign Up to like & get
recommendations!
Published in 2019 at "Computational Mathematics and Mathematical Physics"

DOI: 10.1134/s0965542519080074

Abstract: The knapsack problem with Boolean variables and a single constraint is studied. In the general case, this problem is NP-hard; for this reason, its exact solution requires the use of various search algorithms with the… read more here.

Keywords: properties knapsack; knapsack problem; problem; objective function ... See more keywords