EATKG: An Open-Source Efficient Exact Algorithm for the Two-Dimensional Knapsack Problem with Guillotine Constraints.

Authors: Wang, Sunkanghong¹ (AUTHOR) wskh0929@gmail.com, Baldacci, Roberto² (AUTHOR) rbaldacci@hbku.edu.qa, Liu, Qiang¹ (AUTHOR) liuqiang@gdut.edu.cn, Wei, Lijun¹ (AUTHOR) villagerwei@gdut.edu.cn

Source: European Journal of Operational Research. Dec2025, Vol. 327 Issue 3, p735-753. 19p.

Subject Terms: *ALGORITHMS, *MATHEMATICAL optimization, KNAPSACK problems, MATHEMATICAL bounds, DETERMINISTIC algorithms

The quadratic knapsack problem.

Authors: Galli, Laura¹ (AUTHOR) l.galli@unibo.it, Martello, Silvano^1,2 (AUTHOR) silvano.martello@unibo.it, Toth, Paolo² (AUTHOR) paolo.toth@unibo.it

Source: European Journal of Operational Research. Oct2025, Vol. 326 Issue 1, p1-12. 12p.

Subject Terms: *MATHEMATICAL models, KNAPSACK problems, APPROXIMATION algorithms, COMBINATORIAL optimization, METAHEURISTIC algorithms

k-Submodular Maximization Under Individual Knapsack Constraints: Applications and Streaming Algorithm.

Authors: Tran, Tan D.¹ (AUTHOR) tan.trandinh@phenikaa-uni.edu.vn, Pham, Canh V.¹ (AUTHOR) canh.phamvan@phenikaa-uni.edu.vn, Ha, Dung T. K.² (AUTHOR) 20028008@vnu.edu.vn

Source: Asia-Pacific Journal of Operational Research. Jul2025, p1. 27p.

Subject Terms: *MATHEMATICAL optimization, *PROFIT maximization, KNAPSACK problems, SENSOR placement, COMBINATORIAL optimization, DATA reduction, APPROXIMATION algorithms, ONLINE algorithms

Fully Polynomial Time Approximation Schemes for Robust Multistage Decision Making.

Authors: Halman, Nir¹ (AUTHOR) halman@mit.edu, Nannicini, Giacomo² (AUTHOR) g.nannicini@usc.edu

Source: INFORMS Journal on Computing. Sep/Oct2025, Vol. 37 Issue 5, p1306-1327. 22p.

Subject Terms: *OPERATIONS research, *DYNAMIC programming, *INVENTORY control, *DECISION making, KNAPSACK problems, APPROXIMATION algorithms

Non-Submodular Maximization Subject to a Knapsack Constraint on the Integer Lattice.

Authors: Zhang, Zhenning¹ (AUTHOR) zhangzhenning@bjut.edu.cn, Guo, Longkun² (AUTHOR) longkun.guo@gmail.com, Liao, Kewen³ (AUTHOR) kewen.liao@deakin.edu.au, Wang, Yishui⁴ (AUTHOR) wangys@ustb.edu.cn, Xu, Dachuan¹ (AUTHOR) xudc@bjut.edu.cn, Zhang, Dongmei⁵ (AUTHOR) zhangdongmei@sdjzu.edu.cn

Source: International Journal of Foundations of Computer Science. Aug2025, p1-27. 27p.

Subject Terms: *MATHEMATICAL optimization, KNAPSACK problems, GREEDY algorithms, CURVATURE, LATTICE theory

Knapsack Problems with Monotonically Non-Decreasing Variable Weights (Profits) of Items.

Authors: Kong, Fanyu¹ (AUTHOR) fanyukong2024@163.com, Zhang, Yuzhong¹ (AUTHOR) yuzhongrz@163.com

Source: International Journal of Foundations of Computer Science. Jul2025, p1-12. 12p.

Subject Terms: *DYNAMIC programming, *MATHEMATICAL optimization, KNAPSACK problems, MATHEMATICAL functions, APPROXIMATION algorithms, MONOTONIC functions, EXPONENTIAL functions

Submodular + Supermodular function maximization with knapsack constraint.

Authors: Shi, Majun¹ (AUTHOR), Yang, Zishen² (AUTHOR), Wang, Wei^1,2 (AUTHOR) wang_weiw@163.com

Source: Discrete Applied Mathematics. Dec2025, Vol. 377, p113-133. 21p.

Subject Terms: *SUBMODULAR functions, *KNAPSACK problems, *MATHEMATICAL analysis, *COST functions, *CURVATURE, *POLYNOMIAL time algorithms, *GREEDY algorithms, *APPROXIMATION algorithms

An extension of Dembo–Hammer’s reduction algorithm for the 0-1 knapsack problem.

Authors: Yang, Yang¹ (AUTHOR) zhugemutian@stu.xmu.edu.cn

Source: Discrete Mathematics, Algorithms & Applications. Nov2025, p1. 16p.

Subject Terms: *KNAPSACK problems, *ALGORITHMS, *MATHEMATICAL optimization

Binary Differential Evolution with a Limited Maximum Number of Dimension Changes.

Authors: Filgueira, Jade¹ (AUTHOR) antonini@utfpr.edu.br, Antonini Alves, Thiago^1,2 (AUTHOR), Santana, Clodomir^2,3 (AUTHOR), Converti, Attilio^3,4 (AUTHOR) carmelo.filho@upe.br, Bastos-Filho, Carmelo J. A.^1,4 (AUTHOR), Siqueira, Hugo^1,2 (AUTHOR)

Source: Algorithms. Oct2025, Vol. 18 Issue 10, p621. 20p.

Subject Terms: *DIFFERENTIAL evolution, *KNAPSACK problems, *FEATURE selection, *MATHEMATICAL optimization, *EVOLUTIONARY algorithms, *OPTIMIZATION algorithms

Customizable Length Constrained Image-Text Summarization via Knapsack Optimization.

Authors: Liu, Xuan^1,2 (AUTHOR), Qu, Xiangyu^1,2 (AUTHOR), Weng, Yu¹ (AUTHOR), Gao, Yutong¹ (AUTHOR) ytgao92@muc.edu.cn, Liu, Zheng¹ (AUTHOR), Liu, Xianggan² (AUTHOR)

Source: Symmetry (20738994). Oct2025, Vol. 17 Issue 10, p1629. 23p.

Subject Terms: *KNAPSACK problems, *COMBINATORIAL optimization, *AUTOMATIC summarization, *TEXT summarization, *MULTIMODAL user interfaces, *DEEP learning, *LENGTH measurement

New Binary Reptile Search Algorithms for Binary Optimization Problems.

Authors: Crawford, Broderick¹ (AUTHOR) broderick.crawford@pucv.cl, López Cortés, Benjamín^1,2 (AUTHOR), Cisternas-Caneo, Felipe^1,3 (AUTHOR), Gómez-Pulido, José Manuel^2,3,4 (AUTHOR), Olivares, Rodrigo⁵ (AUTHOR), Soto, Ricardo^1,6 (AUTHOR), Barrera-Garcia, José^1,6,7 (AUTHOR), Brante-Aguilera, Cristóbal^7,8 (AUTHOR), Giachetti, Giovanni^1,8 (AUTHOR)

Source: Biomimetics (2313-7673). Oct2025, Vol. 10 Issue 10, p653. 25p.

Subject Terms: *KNAPSACK problems, *TRANSFER functions, *METAHEURISTIC algorithms, *MATHEMATICAL optimization, *DISCRETIZATION methods

Discrete optimization: A quantum revolution?

Authors: Creemers, Stefan¹ (AUTHOR) stefan.creemers@uclouvain.be, Armas, Luis Fernando Pérez² (AUTHOR) l.perezarmas@ieseg.fr

Source: European Journal of Operational Research. Jun2025, Vol. 323 Issue 2, p378-408. 31p.

Subject Terms: *QUANTUM computing, *PROBLEM solving, *ALGORITHMS, KNAPSACK problems, BACKPACKS

A fast and effective breakpoints heuristic algorithm for the quadratic knapsack problem.

Authors: Hochbaum, D.S.¹ (AUTHOR) dhochbaum@berkeley.edu, Baumann, P.^1,2 (AUTHOR) philipp.baumann@unibe.ch, Goldschmidt, O.³ (AUTHOR) goldoliv@gmail.com, Zhang, Y.¹ (AUTHOR) yiqing_zhang@berkeley.edu

Source: European Journal of Operational Research. Jun2025, Vol. 323 Issue 2, p425-440. 16p.

Subject Terms: KNAPSACK problems, GREEDY algorithms, HEURISTIC algorithms, COMBINATORIAL optimization, SOURCE code

Adaptive feasible and infeasible evolutionary search for the knapsack problem with forfeits.

Authors: Zhou, Qing¹ (AUTHOR) zhouqing@mail.neu.edu.cn, Hao, Jin‐Kao² (AUTHOR) jin-kao.hao@univ-angers.fr, Jiang, Zhong‐Zhong¹ (AUTHOR) zzjiang@mail.neu.edu.cn, Wu, Qinghua³ (AUTHOR) qinghuawu1005@gmail.com

Source: International Transactions in Operational Research. May2025, Vol. 32 Issue 3, p1442-1471. 30p.

Subject Terms: *HEURISTIC, *ALGORITHMS, KNAPSACK problems, BACKPACKS, DESIGN techniques

A practical approach for dealing with hard knapsack problems using general‐purpose integer programming software.

Authors: Song, Myung Soon¹ (AUTHOR) song@kutztown.edu, Lin, Pei Hua² (AUTHOR) plin983@live.kutztown.edu, Lu, Yun¹ (AUTHOR) lu@kutztown.edu, Shively‐Ertas, Emre² (AUTHOR) emre.shively@gmail.com, Vasko, Francis J.¹ (AUTHOR) vasko@kutztown.edu

Source: International Transactions in Operational Research. May2025, Vol. 32 Issue 3, p1472-1493. 22p.

Subject Terms: *INTEGER programming, *INTEGRATED software, *OPERATIONS research, *ALGORITHMS, KNAPSACK problems

Tight Guarantees for Multiunit Prophet Inequalities and Online Stochastic Knapsack.

Authors: Jiang, Jiashuo¹ (AUTHOR) jsjiang@ust.hk, Ma, Will² (AUTHOR) wm2428@gsb.columbia.edu, Zhang, Jiawei³ (AUTHOR) jz31@stern.nyu.edu

Source: Operations Research. May/Jun2025, Vol. 73 Issue 3, p1703-1721. 19p.

Subject Terms: *RESOURCE allocation, *LINEAR programming, *PROBLEM solving, KNAPSACK problems

The influence of task complexity factors on decision-making performance.

Alternate Title: O impacto de fatores da complexidade da tarefa na performance na tomada de decisão.

Authors: Schneider Bender, Carolina¹ carolisbender@gmail.com, Leodir Löbler, Mauri¹ mllobler@gmail.com, dos Reis Lehnhart, Eliete¹ eliete.lehnhart@ufsm.br

Source: Brazilian Journal of Management / Revista de Administração da UFSM. Apr-Jun2025, Vol. 18 Issue 2, p1-37. 37p.

Subject Terms: KNAPSACK problems, PHASE transitions, COGNITIVE load, COMPUTATIONAL complexity, DEPENDENT variables

A NONPARAMETRIC ROBUST OPTIMIZATION APPROACH FOR CHANCE-CONSTRAINED KNAPSACK PROBLEM.

Authors: XU, LIANG¹ arecxuliang1112@swufe.edu.cn, ZHANG, CHAO² 103396@cqmu.edu.cn, XU, ZHOU³ zhou.xu@polyu.edu.hk, LONG, DANIEL ZHUOYU⁴ zylong@se.cuhk.edu.hk

Source: SIAM Journal on Optimization. 2025, Vol. 35 Issue 2, p739-766. 28p.

Subject Terms: *DYNAMIC programming, *NONPARAMETRIC statistics, ROBUST optimization, KNAPSACK problems, RANDOM sets, OPTIMIZATION algorithms, STOCHASTIC programming, COMBINATORIAL optimization

0/1 Knapsack problem on hyper hexa-cell interconnection network.

Authors: Mahafzah, Basel A.^1,2 (AUTHOR) b.mahafzah@ju.edu.jo, Al-Tawil, Marwan¹ (AUTHOR), Krunz, Marwan³ (AUTHOR)

Source: Cluster Computing. Feb2026, Vol. 29 Issue 1, p1-17. 17p.

Subject Terms: *KNAPSACK problems, *DYNAMIC programming, *MATHEMATICAL optimization, *MULTISTAGE interconnection networks, *ALGORITHMS

A survey of online knapsack problems.

Authors: Böckenhauer, Hans-Joachim¹ (AUTHOR) hjb@inf.ethz.ch, Hromkovič, Juraj¹ (AUTHOR) juraj.hromkovic@inf.ethz.ch, Komm, Dennis¹ (AUTHOR) dennis.komm@inf.ethz.ch, Rossmanith, Peter² (AUTHOR) rossmani@cs.rwth-aachen.de, Stocker, Moritz¹ (AUTHOR) moritz.stocker@inf.ethz.ch

Source: Discrete Applied Mathematics. Jan2026, Vol. 378, p492-507. 16p.

Subject Terms: *KNAPSACK problems, *ONLINE algorithms, *ALGORITHMS, *PROBLEM solving, *RESEARCH questions