Search Results - "NP-hard problems"

Algorithms for Loot Box Design.

Authors: Han, Jiangze Ryan, Christopher Thomas Tong, Xin T.

Source: Operations Research. May/Jun2026, Vol. 74 Issue 3, p1321-1338. 18p.

A p-Step Formulation for the Capacitated Vehicle Routing Problem.

Authors: Dollevoet, Twan Munari, Pedro Spliet, Remy

Source: Transportation Science (INFORMS). Jan/Feb2026, Vol. 60 Issue 1, p87-100. 14p.

Review of recent advances on the resource-constrained project scheduling problem.

Authors: Ghasemi, Mohammad Nazari, Asef Thiruvady, Dhananjay

Source: International Journal of Production Research. Jun2026, p1-44. 44p. 12 Illustrations.

Single-machine batch scheduling with split jobs and a maintenance activity.

Authors: Zhang, Junyi Zou, Juan Ma, Ran

Source: International Journal of Production Research. May2026, p1-15. 15p. 6 Illustrations.

The K‐prize‐collecting coverage problem by aligned disks.

Authors: Zhang, Hao Zheng, Xiya Liu, Zhonghao et al.

Source: International Transactions in Operational Research. Jul2026, Vol. 33 Issue 4, p2688-2708. 21p.

A Monte Carlo-based algorithm for the quickest path flow network reliability problem.

Authors: Huang, Cheng-Fu¹ (AUTHOR) cfuhuang@fcu.edu.tw

Source: Annals of Operations Research. Jun2026, Vol. 361 Issue 3, p1077-1089. 13p.

Rank-One Boolean Tensor Factorization and the Multilinear Polytope.

Authors: Del Pia, Alberto Khajavirad, Aida

Source: Mathematics of Operations Research (INFORMS). May2025, Vol. 50 Issue 2, p1514-1554. 41p.

Hardness of Pricing Routes for Two-Stage Stochastic Vehicle Routing Problems with Scenarios.

Authors: Ota, Matheus J. Fukasawa, Ricardo

Source: Operations Research. Jul/Aug2025, Vol. 73 Issue 4, p2177-2187. 11p.

An approximation algorithm for mobile multi-agent monitoring and routing problem.

Authors: Kim, Gwang Jeong, Yoonjea

Source: Flexible Services & Manufacturing Journal; Jun2026, Vol. 38 Issue 2, p805-831, 27p

Constant-Ratio polynomial time approximation of the asymmetric minimum weight cycle cover problem with limited number of cycles.

Authors: Khachay, Michael Neznakhina, Katherine Rizhenko, Ksenia

Source: Communications in Combinatorics & Optimization. Jun2026, Vol. 12 Issue 2, p419-432. 14p.

Jumping particle swarm-based local search approach for the maximum weighted independent set problem.

Authors: Maheswari, G. Balaji, S. Revathi, N. et al.

Source: Discrete Mathematics, Algorithms & Applications. May2026, Vol. 18 Issue 4, p1-13. 13p.

The Strong Maximum Circulation Algorithm: A New Method for Aggregating Preference Rankings.

Authors: Atkinson, Nathan Ganz, Scott Hochbaum, Dorit et al.

Source: INFORMS Journal on Optimization. Spring2025, Vol. 7 Issue 2, p142-155. 14p.

Fast Combinatorial Algorithms for Efficient Sortation.

Authors: Van Dyk, Madison Klause, Kim Koenemann, Jochen et al.

Source: Mathematical Programming. Mar2026, Vol. 216 Issue 1/2, p221-254. 34p.

S4 SEPARATION AND P-PARTITION IN ALL-PATH AND DETOUR CONVEXITIES.

Authors: HAPONENKO, V.^1,2, vladyslav.haponenko@gmail.com

Source: TWMS Journal of Applied & Engineering Mathematics; 2026, Vol. 16 Issue 4, p443-456, 14p

FinOps-Aware Budget-Constrained Optimization for Cloud Resource Management.

Authors: Cho, Choong-Hee¹

Source: Applied Sciences (2076-3417); Apr2026, Vol. 16 Issue 7, p3302, 48p

Assortment optimization with visibility constraints.

Authors: Barré, Théo Housni, Omar El Brahim, Marouane Ibn et al.

Source: Mathematical Programming; Mar2026, Vol. 216 Issue 1/2, p177-220, 44p

The Power of the Lorentz Quantum Computer.

Authors: Zhang, Qi Wu, Biao

Source: Entropy. Mar2026, Vol. 28 Issue 3, p266. 24p.

Preface to the Special Issue on "Combinatorial Optimization and Applications".

Authors: Sciomachen, Anna¹ (AUTHOR)

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

Evolutionary Optimization for Job Shop Scheduling with Blocking: A Genetic Algorithm Approach.

Authors: Valencia, John Rodríguez-Velásquez, Elkin

Source: Algorithms. Feb2026, Vol. 19 Issue 2, p115. 15p.

Minimum Stable Cut and Treewidth.

Authors: Lampis, Michael¹

Source: Discrete Mathematics & Theoretical Computer Science (DMTCS). 2026, Vol. 28 Issue 2, p1-28. 28p.

Subjects: NP-hard problems, Computational complexity, Graph theory, Parameterization, Approximation algorithms