Results 81 to 90 of about 4,775,611 (190)
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
The one‐dimensional cutting stock problem with sequence‐dependent setups
International Transactions in Operational Research, EarlyView.Abstract The cutting stock problem (CSP) is a classic operations research problem with several applications in real‐world scenarios. It involves cutting large objects into smaller items to satisfy customer demands, minimizing the number of cut objects.
Eduardo M. Silva +3 more
wiley +1 more source
Two‐dimensional guillotine cutting problem for large objects with non‐rectangular shapes
International Transactions in Operational Research, EarlyView.Abstract In this paper, we address the two‐dimensional single large object placement problem with guillotine cutting constraints, focusing on non‐rectangular shapes. We consider objects with circular or convex polygonal geometries and study a variant that includes defective regions from which no items can be extracted. Rectangular items are cut using a
Carise E. Schmidt +3 more
wiley +1 more source
Knapsack based optimal policies for budget-limited multi-armed bandits
, 2012 In budget-limited multi-armed bandit (MAB) problems, the learner’s actions are costly and constrained by a fixed budget. Consequently, an optimal exploitation policy may not be to pull the optimal arm repeatedly, as is the case in other variants of MAB ...
Tran-Thanh, Long +4 more
core +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
Minimizing cutting costs in 1D rod cutting
International Transactions in Operational Research, EarlyView.Abstract We study a one‐dimensional rod‐cutting problem arising from an industrial setting where cutting itself carries cost. Each order specifies a length interval, and the task is to assign orders to warehouse rods so that all orders are satisfied while the number of cuts is minimized.
Bowen Li, Attila Sali
wiley +1 more source
Binary Moth Search Algorithm for Discounted {0-1} Knapsack Problem
IEEE Access, 2018 The discounted {0-1} knapsack problem (DKP) extends the classical 0-1 knapsack problem (0-1 KP) in which a set of item groups is included and each group consists of three items, whereas at most one of the three items can be packed into the knapsack ...
Yan-Hong Feng, Gai-Ge Wang
doaj +1 more source
Journal of Agrarian Change, EarlyView.ABSTRACT Pesticide use is expanding rapidly across sub‐Saharan Africa, while regulatory oversight and public protection structures remain weak, leaving smallholder farmers exposed to mounting health and environmental risks. In response, agrochemical industry actors have launched ‘safe use’ initiatives that emphasize training and personal protective ...
Elina Andersson +2 more
wiley +1 more source
Journal of Agrarian Change, EarlyView.ABSTRACT What do pesticide companies do to keep their products on the market despite strong societal and scientific critiques of their environmental and health risks? This paper examines the herbicide paraquat, one of the most controversial pesticides, from the early 1960s to the present.
Kees Jansen
wiley +1 more source
A quantum algorithm for solving 0-1 Knapsack problems
npj Quantum InformationWe present two novel contributions for achieving and assessing quantum advantage in solving difficult optimisation problems, both in theory and foreseeable practice.
Sören Wilkening +5 more
doaj +1 more source