Articles with "knapsack" 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 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 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

An exact constructive algorithm for the knapsack sharing problem

Sign Up to like & get
recommendations!
Published in 2017 at "Optimization Methods and Software"

DOI: 10.1080/10556788.2016.1240795

Abstract: In this paper, we study the knapsack sharing problem (KSP), a variant of the well-known NP-hard single knapsack problem. We propose an exact constructive tree search that combines two complementary procedures: a reduction interval search… read more here.

Keywords: reduction; exact constructive; knapsack; knapsack sharing ... 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 by gabriellefaithhenderson from unsplash

Develop an optimal washing and care mode for knapsack

Sign Up to like & get
recommendations!
Published in 2022 at "Journal of Industrial Textiles"

DOI: 10.1177/15280837221149216

Abstract: In order to develop a suitable washing mode for knapsack, mechanical agitation (1), water bath vibration (2), ultrasonic (3), micro-nano bubble (4) and complex washing mode of the two were systematically investigated. Results showed that… read more here.

Keywords: knapsack; agitation; mechanical agitation; micro nano ... See more keywords
Photo by gabriellefaithhenderson from unsplash

Binary salp swarm algorithm for discounted {0-1} knapsack problem

Sign Up to like & get
recommendations!
Published in 2022 at "PLoS ONE"

DOI: 10.1371/journal.pone.0266537

Abstract: While the classical knapsack problem has been the object to be solved by optimization algorithm proposals for many years, another version of this problem, discounted {0-1} knapsack problem, is gaining a lot of attention recently.… read more here.

Keywords: discounted knapsack; salp swarm; knapsack problem; knapsack ... See more keywords
Photo by theblowup from unsplash

Efficient 0/1-Multiple-Knapsack Problem Solving by Hybrid DP Transformation and Robust Unbiased Filtering

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

DOI: 10.3390/a15100366

Abstract: The multiple knapsack problem (0/1-mKP) is a valuable NP-hard problem involved in many science-and-engineering applications. In current research, there exist two main approaches: 1. the exact algorithms for the optimal solutions (i.e., branch-and-bound, dynamic programming… read more here.

Keywords: problem; optimal solutions; robust unbiased; knapsack ... See more keywords