Results 91 to 100 of about 28,713 (220)
The Knapsack Problem with Conflict Graphs
Journal of Graph Algorithms and Applications, 2009 Summary: We extend the classical 0-1 knapsack problem by introducing disjunctive constraints for pairs of items which are not allowed to be packed together into the knapsack. These constraints are represented by edges of a conflict graph whose vertices correspond to the items of the knapsack problem.
Ulrich Pferschy, Joachim Schauer
openaire +2 more sources
Scenario‐Based Platoon Lane Network Design
Networks, Volume 87, Issue 4, Page 443-459, June 2026.ABSTRACT A truck platoon is a set of trucks that drive behind one another at short headways to save fuel, reduce emissions, and improve traffic throughput. Despite the potential benefits of platooning, road operators have raised concerns about the impact of platoons on surrounding traffic.
Anirudh Kishore Bhoopalam +2 more
wiley +1 more source
Безопасность информационных технологий, 2015 Keywords: In this paper, we propose a new approach to the definition of basic problems in a constructive enumeration of combinations of knapsack vector elements.
Georgii Ivanovich Borzunov +1 more
doaj
On Solving the Knapsack Problem with Conflicts
MathematicsA variant of the well-known Knapsack Problem is studied in this paper. In the classic problem, a set of items is given, with each item characterized by a weight and a profit.
Roberto Montemanni, Derek H. Smith
doaj +1 more source
FINDING OF OPTIMAL SUBSET STRUCTURE IN THE KNAPSACK PROBLEM
Доклады Белорусского государственного университета информатики и радиоэлектроники, 2019 An algorithm for solving the knapsack problem based on the proposed multi-criteria model is considered. The implementation of this algorithm allows to define the structure of the optimal subset as a union of certain elements of a Pareto layers group into
S. V. Chebakov, L. V. Serebryanaya
doaj +1 more source
Natural Sciences Education, Volume 55, Issue 1, June 2026.Abstract The growing number of multilingual learners (MLs) in science, technology, engineering, and mathematics (STEM) classrooms in the United States has compelled teachers to innovate their instructional and assessment practices to better meet the diverse and evolving needs of students. By centering teachers’ own interpretations and reflections, this
Bilgehan Ayik +4 more
wiley +1 more source
Eskişehir Osmangazi Üniversitesi Mühendislik ve Mimarlık Fakültesi DergisiModeling the foraging behavior of honey badgers, the Honey Badger Algorithm (HBA) is a recently proposed metaheuristic algorithm. In this study, a binary version of this algorithm that was proposed for solving continuous optimization problems was ...
Emine Baş, Gülnur Yıldızdan
doaj +1 more source
Deep Reinforcement Learning Algorithms for Heterogeneous Multiple Knapsack Problems [PDF]
Jisuanji gongchengBy focusing on the traditional multi-Knapsack Problem (KP) in typical logistics system operations, this study abstracts a Heterogeneous Multiple Knapsack Problem (HMKP) and formulates an improved Deep Deterministic Policy Gradient (DDPG) algorithm to ...
LI Bin, GUO Yi
doaj +1 more source
Spotting Difficult Weakly Correlated Binary Knapsack Problems [PDF]
In this paper, we examine the possibility of quickly deciding whether or not an instance of a binary knapsack problem is difficult for branch and bound algorithms.
Bandyopadhyay, Tathagata, Ghosh, Diptesh
core
TESOL Quarterly, Volume 60, Issue 2, Page 846-866, June 2026.Abstract Contemporary research in TESOL spans a range of ethnographic approaches from ethnography of communication and language socialization to narrative inquiry, critical ethnography, autoethnography, and digital ethnography. The foci of ethnographic work have evolved from earlier work focusing on interactional approaches that examined how L2 ...
Peter Sayer
wiley +1 more source