Results 41 to 50 of about 5,749 (206)
International Transactions in Operational Research, Volume 33, Issue 2, Page 719-774, March 2026.Abstract The transformative potential of artificial intelligence (AI) ChatBots, leveraging natural language processing for information retrieval and knowledge synthesis, has garnered attention across diverse fields, including research. Recognizing AI's importance, researchers and policymakers are actively engaged in its development.
Cinzia Daraio +2 more
wiley +1 more source
Journal of King Saud University: Computer and Information SciencesThis paper examines the performance of three binary metaheuristic algorithms when applied to two distinct knapsack problems (0–1 knapsack problems (KP01) and multidimensional knapsack problems (MKP)).
Mohamed Abdel-Basset +5 more
doaj +1 more source
, 2020 We introduce the idea that using optimal classification trees (OCTs) and optimal classification trees with-hyperplanes (OCT-Hs), interpretable machine learning algorithms developed by Bertsimas and Dunn [2017, 2018], we are able to obtain insight on the ...
Bertsimas, Dimitris +1 more
core +1 more source
Small Space Stream Summary for Matroid Center [PDF]
, 2019 In the matroid center problem, which generalizes the k-center problem, we need to pick a set of centers that is an independent set of a matroid with rank r. We study this problem in streaming, where elements of the ground set arrive in the stream.
Kale, Sagar
core +2 more sources
Engineering Reports, Volume 8, Issue 2, February 2026.Quantum computing techniques such as Quantum Annealing and Quadratic Unconstrained Binary Optimization are effectively solving NP‐hard problems in operations management and research, particularly in logistics, manufacturing, and finance. This study maps these applications to present a framework for future adoption across industries. ABSTRACT This study
Daniel Bouzon Nagem Assad +3 more
wiley +1 more source
Iterated responsive threshold search for the quadratic multiple knapsack problem [PDF]
, 2014 The quadratic multiple knapsack problem (QMKP) consists in assigning objects with both individual and pairwise profits to a set of limited knapsacks in order to maximize the total profit. QMKP is a NP-hard combinatorial optimization problem with a number
J.K. Hao, Y. Chen
core +4 more sources
IET Control Theory &Applications, Volume 20, Issue 1, January/December 2026.This paper proposes a relatively simple non‐linear mathematical model describing the effect of meal order and timing on postprandial glucose response. The problem of optimal control of postprandial blood glucose response by meal order is stated and solved for the proposed non‐linear model.
Andrey V. Savkin, Xiaotian Feng
wiley +1 more source
IET Intelligent Transport Systems, Volume 20, Issue 1, January/December 2026.We propose CEPAPT–a trip‐chain integrated auction mechanism for parking allocation that dynamically optimises multi‐destination requests. Our incentive‐compatible design ensures truthful bidding while achieving 71.11% slot utilisation and $166K social welfare at scale.
Jing‐Qin Wang +4 more
wiley +1 more source
Resource allocation algorithm for situation awareness based on multiple-choice quadratic knapsack
Tongxin xuebao, 2016 In order to deal with the potential cyber-threat and improve the security situation by using limited resource properly, the optimal allocation of resource focused on cyber security situation.
Yan-wei SUN +3 more
doaj
Knapsack Problems in Groups [PDF]
, 2013 We generalize the classical knapsack and subset sum problems to arbitrary groups and study the computational complexity of these new problems. We show that these problems, as well as the bounded submonoid membership problem, are P-time decidable in ...
Myasnikov, Alexei +2 more
core