Search Results - "Knapsack problems"

The Competitive Ratio of Threshold Policies for Online Unit-Density Knapsack Problems.

Authors: Ma, Will Simchi-Levi, David Zhao, Jinglong

Source: Management Science (INFORMS). Jul2026, Vol. 72 Issue 7, p5681-5697. 17p.

Fully Polynomial Time Approximation Schemes for Robust Multistage Decision Making.

Authors: Halman, Nir Nannicini, Giacomo

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

Tight Guarantees for Multiunit Prophet Inequalities and Online Stochastic Knapsack.

Authors: Jiang, Jiashuo Ma, Will Zhang, Jiawei

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

Approximation Algorithms for k-Submodular Maximization Subject to a Knapsack Constraint.

Authors: Xiao, Hao Liu, Qian Zhou, Yang et al.

Source: Journal of the Operations Research Society of China. Jun2026, Vol. 14 Issue 2, p397-412. 16p.

Branch-and-Price for the Set-Union Bin Packing Problem.

Authors: Wahlen, Julia Gschwind, Timo

Source: INFORMS Journal on Computing; May/Jun2026, Vol. 38 Issue 3, p844-861, 18p

The Online Saddle Point Problem and Online Convex Optimization with Knapsacks.

Authors: Rivera Cardoso, Adrian Wang, He Xu, Huan

Source: Mathematics of Operations Research (INFORMS). Feb2025, Vol. 50 Issue 1, p1-39. 39p.

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

Authors: Tran, Tan D. Pham, Canh V. Ha, Dung T. K.

Source: Asia-Pacific Journal of Operational Research. Aug2026, Vol. 43 Issue 4, p1-27. 27p.

Lower bounds on the complexity of mixed-integer programs for stable set and knapsack.

Authors: Schade, Jamico Sinha, Makrand Weltge, Stefan

Source: Mathematical Programming. Mar2026, Vol. 216 Issue 1/2, p135-176. 42p.

Two Knapsacks Are Better than One for Both Soft and Hard Conflict Constraints.

Authors: Cadiz, Peter Lu, Yun Song, Myung Soon et al.

Source: Mathematics (2227-7390). Apr2026, Vol. 14 Issue 8, p1317. 10p.

Knapsack- and Dynamic Programming-Based Symmetric Optimization for Material Multi-Objective Storage.

Authors: Li, Lun Liu, Xiaochen Yao, Shixuan et al.

Source: Symmetry (20738994). Apr2026, Vol. 18 Issue 4, p583. 19p.

Solving Combinatorial Pricing Problems Using Embedded Dynamic Programming Models.

Authors: Bui, Quang Minh Carvalho, Margarida Neto, José

Source: INFORMS Journal on Computing; Mar/Apr2026, Vol. 38 Issue 2, p548-567, 20p

Spatial Branch-and-Bound for Nonconvex Separable Piecewise Linear Optimization.

Authors: Hübner, Thomas Gupte, Akshay Rebennack, Steffen

Source: INFORMS Journal on Computing; Mar/Apr2026, Vol. 38 Issue 2, p645-675, 31p

BAPO: Binary Arctic Puffin Optimization Based on Hybrid Transfer Function.

Authors: Wang, Hanyu Liu, Jianhua

Source: Applied Sciences (2076-3417); Mar2026, Vol. 16 Issue 5, p2222, 26p

Streaming Algorithms for Maximizing k-Submodular Functions with the Multi-knapsack Constraint.

Authors: Gong, Shu-Fang Liu, Bin Fang, Qi-Zhi

Source: Journal of the Operations Research Society of China. Mar2026, Vol. 14 Issue 1, p325-343. 19p.

A Hybrid Machine Learning–Metaheuristic Approach to Solving the Quadratic Multidimensional Knapsack Problem.

Authors: Tapia-Oñate, Jorge Rey, Carlos

Source: Mathematics (2227-7390). Feb2026, Vol. 14 Issue 4, p666. 25p.

Solution Algorithm Involving Heuristics and Criterion Set Dissection to Solve Large Scale Multicriteria Knapsack Problems.

Authors: Mladenović, N. Stanojević, B.

Source: International Journal of Computers, Communications & Control; Feb2026, Vol. 21 Issue 1, p1-17, 17p

A Column Generation Scheme for Distributionally Robust Multi-Item Newsvendor Problems.

Authors: Wang, Shanshan Delage, Erick

Source: INFORMS Journal on Computing. May/Jun2024, Vol. 36 Issue 3, p849-867. 19p.

Non-Monotonicity of Branching Rules with Respect to Linear Relaxations.

Authors: Shah, Prachi Dey, Santanu S. Molinaro, Marco

Source: INFORMS Journal on Computing; Jan/Feb2026, Vol. 38 Issue 1, p53-66, 14p

Determining the Best Algorithm for the Knapsack Problem with Forfeits.

Authors: Cadiz, Peter Lu, Yun Song, Myung Soon et al.

Source: Mathematics (2227-7390). Jan2026, Vol. 14 Issue 1, p143. 7p.

A Feasible Method for Solving an SDP Relaxation of the Quadratic Knapsack Problem.

Authors: Tang, Tianyun Toh, Kim-Chuan

Source: Mathematics of Operations Research (INFORMS). Feb2024, Vol. 49 Issue 1, p19-39. 21p.