Search Results - "Approximation algorithms"

An Improved Algorithm for a Bipartite Traveling Tournament in Interleague Sports Scheduling.

Authors: Zhao, Jingyang Xiao, Mingyu

Source: Mathematics of Operations Research (INFORMS). May2026, Vol. 51 Issue 2, p988-1006. 19p.

Scheduling with Calibrations for Multi-Interval Jobs.

Authors: Chau, Vincent Damerius, Christoph Kling, Peter et al.

Source: INFORMS Journal on Computing. Mar/Apr2026, Vol. 38 Issue 2, p377-396. 20p.

A Unified Framework to Impose Market Share Constraints for Selected Product Classes: Randomized and Deterministic Assortments Under the Multinomial Logit Model.

Authors: Zhu, Wenchang Rusmevichientong, Paat Topaloglu, Huseyin

Source: Manufacturing & Service Operations Management (M&SOM) (INFORMS). Jan/Feb2026, Vol. 28 Issue 1, p172-192. 21p.

ℓ p -Sphere Covering and Approximating Nuclear p -Norm.

Authors: Guan, Jiewen He, Simai Jiang, Bo et al.

Source: Mathematics of Operations Research (INFORMS). Nov2025, Vol. 50 Issue 4, p3094-3124. 31p.

Improved Guarantees for Offline Stochastic Matching via New Ordered Contention Resolution Schemes.

Authors: Brubach, Brian Grammel, Nathaniel Ma, Will et al.

Source: Mathematics of Operations Research (INFORMS). Nov2025, Vol. 50 Issue 4, p3243-3256. 14p.

Trading Prophets.

Authors: Correa, José Cristi, Andrés Dütting, Paul et al.

Source: Operations Research. Jan/Feb2026, Vol. 74 Issue 1, p260-280. 21p.

Maximum Load Assortment Optimization: Approximation Algorithms and Adaptivity Gaps.

Authors: El Housni, Omar Ibn Brahim, Marouane Segev, Danny

Source: Operations Research. Jan/Feb2026, Vol. 74 Issue 1, p408-429. 22p.

Joint Placement, Delivery Promise, and Fulfillment in Online Retail.

Authors: Bai, Yicheng Rusmevichientong, Paat Topaloglu, Huseyin

Source: Management Science (INFORMS). Nov2025, Vol. 71 Issue 11, p9171-9192. 22p.

Envy-Free Division of Multilayered Cakes.

Authors: Igarashi, Ayumi Meunier, Frédéric

Source: Mathematics of Operations Research (INFORMS). Aug2025, Vol. 50 Issue 3, p2261-2286. 26p.

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.

Exact and Approximation Algorithms for Sparse Principal Component Analysis.

Authors: Li, Yongchun Xie, Weijun

Source: INFORMS Journal on Computing. May/Jun2025, Vol. 37 Issue 3, p582-602. 21p.

Practical Algorithms with Guaranteed Approximation Ratio for Traveling Tournament Problem with Maximum Tour Length 2.

Authors: Zhao, Jingyang Xiao, Mingyu

Source: Mathematics of Operations Research (INFORMS). May2025, Vol. 50 Issue 2, p910-934. 25p.

Nonadaptive Stochastic Score Classification and Explainable Half-Space Evaluation.

Authors: Ghuge, Rohan Gupta, Anupam Nagarajan, Viswanath

Source: Operations Research. Jul/Aug2025, Vol. 73 Issue 4, p2204-2222. 19p.

Assigning and Scheduling Generalized Malleable Jobs Under Subadditive or Submodular Processing Speeds.

Authors: Fotakis, Dimitris Matuschke, Jannik Papadigenopoulos, Orestis

Source: Operations Research. May/Jun2025, Vol. 73 Issue 3, p1598-1614. 17p.

APPROXIMATION ALGORITHMS FOR THE FREEZE TAG PROBLEM INSIDE POLYGONS.

Authors: RAJABI-ALNI, FATEMEH MINAEI-BIDGOLI, BEHROUZ BAGHERI, ALIREZA

Source: Transactions on Combinatorics. Jun2026, Vol. 15 Issue 2, p137-145. 9p.

Direct Product Multicommodity Max-Concurrent-Flow Min-Sparse-Cut Theorem.

Authors: Guan, Rui Liang, Dong-Yue Wang, Wei et al.

Source: Journal of the Operations Research Society of China. Jun2026, Vol. 14 Issue 2, p719-729. 11p.

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.

DC-programming for neural network optimizations.

Authors: Awasthi, Pranjal Mao, Anqi Mohri, Mehryar et al.

Source: Journal of Global Optimization; May2026, Vol. 95 Issue 1, p5-21, 17p

Maximizing the Total Weighted Operating Time for Surgery Scheduling via Linear Program Randomized Rounding Algorithms.

Authors: CHEN, PO-AN CHENG, YA-WEN WU, TSUNG-JUI et al.

Source: Journal of Information Science & Engineering; May2026, Vol. 42 Issue 3, p559-570, 12p

Learn to optimize from structured samples for minimum partial set cover.

Authors: Hong, Weizhi Ran, Yingli Zhang, Zhao

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