Results 51 to 60 of about 28,713 (220)
Scientific Journal of Informatics, 2018 At this time the delivery of goods to be familiar because the use of delivery of goods services greatly facilitate customers. PT Post Indonesia is one of the delivery of goods.
Global Ilham Sampurno +2 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
Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits
, 2016 Initially developed for the min-knapsack problem, the knapsack cover inequalities are used in the current best relaxations for numerous combinatorial optimization problems of covering type.
Bazzi, Abbas +3 more
core +1 more source
Journal of Field Robotics, EarlyView.ABSTRACT This work presents a non‐geometrical navigation approach based on a purely topological understanding of underground environments. By conceptualizing subterranean scenarios as a set of tunnels that intersect with each other, and taking a navigation approach based on topological instructions, we simplify the navigation problem to the sequential ...
Lorenzo Cano +2 more
wiley +1 more source
A Novel Discrete Global-Best Harmony Search Algorithm for Solving 0-1 Knapsack Problems
Discrete Dynamics in Nature and Society, 2014 In order to better solve discrete 0-1 knapsack problems, a novel global-best harmony search algorithm with binary coding, called DGHS, is proposed. First, an initialization based on a greedy mechanism is employed to improve the initial solution quality ...
Wan-li Xiang +4 more
doaj +1 more source
Solving Knapsack Problems Using Radius Particle Swarm Optimization Fuse with Simulated Annealing [PDF]
Journal of Systemics, Cybernetics and Informatics, 2021 We present a novel approach to fuse the Radius Particle Swarm Optimization and Simulated Annealing (RPSO-SA) to solve the Knapsack Problems (KPs). The features RPSO-SA create an innovative approach, which can generate high-quality solutions in shorter ...
Mudarmeen Munlin
doaj
Online Knapsack Problem under Expected Capacity Constraint
, 2017 Online knapsack problem is considered, where items arrive in a sequential fashion that have two attributes; value and weight. Each arriving item has to be accepted or rejected on its arrival irrevocably.
Vaze, Rahul
core +1 more source
Online Minimization Knapsack Problem
Theoretical Computer Science, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xin Han, Kazuhisa Makino
openaire +2 more sources
Inkjet‐Printed Physical Unclonable Functions For Secure Authentication
Small, EarlyView.Herein, we propose a low‐cost authentication system based on a scalable fabrication technology and user friendly recognition system. It involves inkjet printing as a manufacturing method and an optical recognition system based on contour features extraction.
Riccardo Sargeni +5 more
wiley +1 more source
MathematicsThe knapsack problem is a typical bi-objective combinatorial optimization issue, wherein maximizing the value of the packed items is achieved concurrently with minimizing the weight of the load.
Ziqian Wang +6 more
doaj +1 more source