Results 81 to 90 of about 5,533,689 (197)
Two-Stage Submodular Maximization Under Knapsack Problem
Tsinghua Science and TechnologyTwo-stage submodular maximization problem under cardinality constraint has been widely studied in machine learning and combinatorial optimization. In this paper, we consider knapsack constraint.
Zhicheng Liu +3 more
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
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
Науковий вісник Ужгородського університету. Серія: Математика і інформатика, 2017 The method of finding of attainable optimum solutions of lexicographic knapsack problem with alternative criteria by reducing it to the problem of onecriterion optimization with a scalar objective function is considered.
A. Ю. Брила, В. I. Гренджа
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
An index for dynamic product promotion and the knapsack problem for perishable items [PDF]
This paper introduces the knapsack problem for perishable items (KPPI), which concerns the optimal dynamic allocation of a limited promotion space to a collection of perishable items. Such a problem is motivated by applications in a variety of industries,
Peter Jacko, Jose Nino-MOra
core
THE APPLICATION OF NON-INJECTIVE VECTORS IN KNAPSACK CRYPTOSYSTEMS
Безопасность информационных технологийThe paper explores the cryptographic properties of non-injective linear forms and their application in knapsack cryptosystems. The primary goal of the work is to analyze the potential for using non-injective knapsacks as private keys to ensure the ...
Maria Sabina A. Volkov +1 more
doaj +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
MathematicsThe quadratic multidimensional knapsack problem (QMdKP) is a combinatorial optimization problem that involves selecting a subset of items to maximize both linear and quadratic profits without exceeding the capacity constraints across multiple dimensions.
Jorge Tapia-Oñate, Carlos Rey
doaj +1 more source