Results 41 to 50 of about 33,818 (220)
Approximation of the Quadratic Knapsack Problem [PDF]
INFORMS Journal on Computing, 2016 We study the approximability of the classical quadratic knapsack problem (QKP) on special graph classes. In this case the quadratic terms of the objective function are not given for each pair of knapsack items. Instead, an edge weighted graph, whose vertices represent the knapsack items, induces a quadratic profit for every pair of items, which is ...
Ulrich Pferschy, Joachim Schauer
openaire +5 more sources
SOLVING MULTIPLE-CONTAINER PACKING PROBLEMS USING PSEUDO-MEIOSIS GENETIC ALGORITHM
Journal of Engineering, 2005 Knapsack problems are a class of common but difficult (NP-complete or NP -hard) problems. Since, it is believed that no knapsack problem algorithm can be constructed whose computation time optimality increases as any polynomial function of the problem ...
Bara'a Ali Attea +1 more
doaj +1 more source
Adaptation of a Mosquito Swarm Algorithm to Solve a Binary Knapsack Problem [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2018 The paper tackled one of the artificial intelligence algorithms which is Mosquito swarm algorithm as a nature inspired algorithms, to solve 0-1 knapsack an optimization problem through adaptation steps of a Mosquito swarm algorithm and the inspiration ...
Ruqaya Sha’ban, Isra Alkallak
doaj +1 more source
A performance model of speculative prefetching in distributed information systems
, 1999 Previous studies in speculative prefetching focus on building and evaluating access models for the purpose of access prediction. This paper investigates a complementary area which has been largely ignored, that of performance modelling.
Kumar, M., Tuah, N. J., Venkatesh, S.
core +2 more sources
American Journal of Community Psychology, EarlyView.Abstract This study used photovoice methodology to explore Asian Americans' perspectives on the root causes and protective factors of firearm violence in their communities. Photovoice provided a participatory platform for community members to document lived experiences and identify priorities for change.
Tsu‐Yin Wu +4 more
wiley +1 more source
Knapsack Balancing via Multiobjectivization
Applied SciencesIn this paper, we address the aspect of knapsack balancing in the classic knapsack problem. Recognizing that excessive dispersion in the objective function or constraint coefficients of the optimal solution can be undesirable, we propose, when ...
Ignacy Kaliszewski, Janusz Miroforidis
doaj +1 more source
Shaping Decision Models for Stochastic Dynamic Optimization Problems via Reinforcement Learning
Networks, EarlyView.ABSTRACT With rising customer expectations and increasing computational potential, many transport, manufacturing, and production operations face real‐time decision making in stochastic dynamic environments. Decision makers must find and adapt complex plans that are effective now but also flexible with respect to future developments.
Florentin D. Hildebrandt +3 more
wiley +1 more source
AN IDEA FOR KNAPSACK CRYPTOSYSTEM BACKDOOR
Безопасность информационных технологийThere are practically no known backdoors in a knapsack cryptosystem, the security of which is based on the difficulty of solving the knapsack packing problem.
Mikhail A. Ivanov
doaj +1 more source
Mathematics, 2021 This paper presents a methodological scheme to obtain the maximum benefit in occupational health by attending to psychosocial risk factors in a company.
Marta Lilia Eraña-Díaz +5 more
doaj +1 more source
Cirsium arvense management with electrical weed control and clopyralid
Pest Management Science, EarlyView.Electrical weed control (EWC) treatments reduced Cirsium arvense biomass by ≤95% and suppressed new shoot emergence by 70–95%, achieving control comparable to clopyralid. Sequential or integrated applications enhanced efficacy, demonstrating EWC's potential as a nonchemical tool for perennial weed management in orchard systems.
Luisa Carolina Baccin +1 more
wiley +1 more source