Results 101 to 110 of about 28,713 (220)
An algorithm for solving a class of knapsack problems and its generalization [PDF]
Computer Science Journal of Moldova, 2005 A class of knapsack problems which generalizes the classical ones is studied. Algorithms based on the dynamical programming and Branch and Bound methods are proposed. The correctness and time estimation of the algorithm are given.
Elena Balan
doaj
Identification and genomic location of resistance to bacterial leaf streak of barley
The Plant Genome, Volume 19, Issue 2, June 2026.Abstract The bacterial leaf streak (BLS) disease of barley (Hordeum vulgare L.), caused by Xanthomonas translucens pv. translucens (Xtt), has become increasingly important worldwide in recent years. Inefficacy of chemical control methods leaves deployment of host resistance to be the only option to manage this disease.
Diel Donne Velasco +5 more
wiley +1 more source
Advances in Computing and EngineeringThe Knapsack problem is a combinatorial optimization problem whose exact solution using exhaustive search method is impractical. Hence, the application of approximate algorithms is usually considered when encountering this optimization problem.
Bashar Bin Usman +5 more
doaj +1 more source
Enhanced Moth Search Algorithm for the Set-Union Knapsack Problems
IEEE Access, 2019 As an important and novel model with multitudinous practical applications, the set-union knapsack problem (SUKP) is a challenging issue in combinatorial optimization.
Yanhong Feng, Jiao-Hong Yi, Gai-Ge Wang
doaj +1 more source
Simmering in the Corridors: An Ethnographic Novella
Anthropology &Education Quarterly, Volume 57, Issue 2, June 2026.ABSTRACT The ethnographic novella “Simmering in the Corridors” blends fiction and ethnography to reflect on academic life within a Department of Social and Cultural Anthropology. It addresses institutional racism, colonial legacies, and power dynamics in academia.
Mara Belacchi Livi +9 more
wiley +1 more source
Solving Assembly Line Balancing Problems by Combining IP and CP
, 2001 Assembly line balancing problems consist in partitioning the work necessary to assemble a number of products among different stations of an assembly line.
Bockmayr, Alexander, Pisaruk, Nicolai
core +1 more source
The quadratic knapsack problem—a survey
Discrete Applied Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Seeing the Hazard: Effects of Visual Communication in Flood Warning Messages
Journal of Flood Risk Management, Volume 19, Issue 2, June 2026.ABSTRACT Early warning messages (EWMs) are a crisis communication tool to prepare citizens to take action, save lives, and prevent damage in case of an approaching flood. They should be simple, but at the same time sufficient, inform recipients about the magnitude, timing, and possible impacts, and offer recommendations on actions to take.
Sarah Lindenlaub +2 more
wiley +1 more source
Psychology and Psychotherapy: Theory, Research and Practice, Volume 99, Issue 2, Page 301-323, June 2026.Abstract Purpose Cognitive‐behavioural therapy for psychosis (CBTp) achieves small to modest effect sizes, which invites the question, ‘What clinical modifications might improve outcomes?’ This paper proposes an integration of CBTp with a neuropsychoanalytic approach that in clinical practice might extend the gains achieved by CBTp alone.
Michael Garrett
wiley +1 more source
Dynamic programming in package Mathematica [PDF]
ITM Web of ConferencesDynamic programming (DP) is a powerful algorithmic technique for solving optimization problems by breaking them down into simpler subproblems. This paper presents an implementation of DP algorithms for two classic optimization problems: the Knapsack ...
Stanimirović Predrag S., Stupin Artem
doaj +1 more source