Results 91 to 100 of about 33,818 (220)
Sensitivity analysis of the greedy heuristic for binary knapsack problems [PDF]
Greedy heuristics are a popular choice of heuristics when we have to solve a large variety of NP -hard combinatorial problems. In particular for binary knapsack problems, these heuristics generate good results.
Chakravarti, N., Ghosh, D., Sierksma, G.
core +1 more source
Sainfoin stand termination: Variable herbicide efficacy in field conditions
Abstract Effective termination of perennial forage legumes is a critical step in a crop rotation system, particularly in arid and semi‐arid regions where soil moisture conservation and timely establishment of subsequent crops are essential. Sainfoin (Onobrychis viciifolia Scop.), a deep‐rooted, drought‐tolerant forage legume gaining renewed interest ...
Surendra Bhattarai +4 more
wiley +1 more source
Fast Polynomial Time Approximate Solution for 0-1 Knapsack Problem. [PDF]
Wang Z, Zhang H, Li Y.
europepmc +1 more source
Soybean and tobacco response to sublethal rates of herbicides used along roadsides
Abstract Herbicides are one of the primary tools for vegetation management along roadsides. However, the drift of particles and vapors from herbicide applications along roadsides can cause damage and yield loss in adjacent sensitive crops. The objective of this research was to investigate the response of soybean [Glycine max (L.) Merr.] and tobacco ...
Estefania Polli +6 more
wiley +1 more source
Scenario‐Based Platoon Lane Network Design
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
A relation between the knapsack and group knapsack problems
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
The Knapsack Problem with Conflict Graphs
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
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
Enhancing Hyperheuristics for the Knapsack Problem through Fuzzy Logic. [PDF]
Olivas F +4 more
europepmc +1 more source
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

