Green robotic warehouses: analysis of carbon emissions in a rack-climbing robotic warehouse.

Tekijät: Chen, Wanying¹ (AUTHOR), Gong, Yeming² (AUTHOR) GONG@em-lyon.com, Hu, Xiangpei³ (AUTHOR), Zhang, Zhengming⁴ (AUTHOR)

Lähde: International Journal of Production Research. Feb2025, p1-16. 16p. 5 Illustrations.

Asiasanat: *LEAD time (Supply chain management), CARBON dioxide, APPROXIMATION algorithms, EMISSION standards, CARBON emissions

Approximation Results: Szász–Kantorovich Operators Enhanced by Frobenius–Euler–Type Polynomials.

Tekijät: Rao, Nadeem¹ (AUTHOR), Farid, Mohammad² (AUTHOR), Raiz, Mohd³ (AUTHOR)

Lähde: Axioms (2075-1680). Apr2025, Vol. 14 Issue 4, p252. 15p.

Asiasanat: *APPROXIMATION algorithms, *CONTINUOUS functions, *NUMERICAL analysis, *POLYNOMIALS

A novel approach for the router nodes placement in wireless mesh networks using phasing with approximation optimization algorithms.

Tekijät: Binh, Le Huu¹ (AUTHOR), T. Duong, Thuy-Van² (AUTHOR) duongthithuyvan@tdtu.edu.vn, M. Ngo, Vuong³ (AUTHOR)

Lähde: PLoS ONE. 1/28/2025, Vol. 20 Issue 1, p1-17. 17p.

Asiasanat: *OPTIMIZATION algorithms, *APPROXIMATION algorithms, *PROBLEM solving, *ALGORITHMS, *WIRELESS mesh networks, *HEURISTIC

Two parallel-machine scheduling with maximum waiting time for an emergency job.

Tekijät: Jiang, Yiwei¹ (AUTHOR), Yuan, Haodong¹ (AUTHOR), Zhou, Ping² (AUTHOR), Cheng, T. C. E.³ (AUTHOR), Ji, Min¹ (AUTHOR) jimkeen@163.com

Lähde: International Journal of Production Research. Aug2024, Vol. 62 Issue 16, p6016-6027. 12p.

Asiasanat: *SCHEDULING, *PRODUCTION scheduling, *MANUFACTURING industries, *SUPPLEMENTARY employment, APPROXIMATION algorithms

A GENERALIZED APPROACH TO INTEGRATION PROCESS BY AUXILIARY FUNCTIONS.

Tekijät: PAKDEMIRLI, MEHMET¹ pakdemirli@gmail.com

Lähde: Journal of Science & Arts. Sep2024, Vol. 24 Issue 3, p533-544. 12p.

Asiasanat: *NUMERICAL integration, *APPROXIMATION algorithms, *INTEGRAL functions, *NUMERICAL analysis, *INTEGRALS

SIGNAL-COMPARISON-BASED DISTRIBUTED ESTIMATION UNDER DECAYING AVERAGE DATA RATE COMMUNICATIONS.

Tekijät: JIEMING KE¹ kejieming@amss.ac.cn, XIAODONG LU² lxd1025744209@163.com, YANLONG ZHAO³ ylzhao@amss.ac.cn, JI-FENG ZHANG⁴ jif@iss.ac.cn

Lähde: SIAM Journal on Control & Optimization. 2025, Vol. 63 Issue 2, p1129-1155. 27p.

Asiasanat: *DATA transmission systems, STOCHASTIC approximation, APPROXIMATION algorithms, NEIGHBORHOODS, POLYNOMIALS, DISTRIBUTED algorithms

PACKING CYCLES IN PLANAR AND BOUNDED-GENUS GRAPHS.

Tekijät: SCHLOMBERG, NIKLAS¹ schlomberg@or.uni-bonn.de, THIELE, HANJO² vygen@or.uni-bonn.de, VYGEN, JENS¹ hanjothiele@freenet.de

Lähde: SIAM Journal on Computing. 2025, Vol. 54 Issue 2, p469-502. 34p.

Asiasanat: *ALGORITHMS, APPROXIMATION algorithms, GEOMETRIC topology, UNDIRECTED graphs, DIRECTED graphs, PLANAR graphs, FAMILIES

A 5-approximation algorithm for the traveling tournament problem.

Tekijät: Zhao, Jingyang¹ (AUTHOR) jingyangzhao1020@gmail.com, Xiao, Mingyu¹ (AUTHOR) myxiao@gmail.com

Lähde: Annals of Operations Research. Mar2025, Vol. 346 Issue 3, p2287-2305. 19p.

Asiasanat: *ALGORITHMS, APPROXIMATION algorithms, COMBINATORIAL optimization, TOURNAMENTS, SPORTS

Approximation Schemes for Parallel Machine Scheduling to Maximize Total Weighted Early Work With a Common Due Date.

Tekijät: Li, Weidong¹ (AUTHOR), Ou, Jinwen² (AUTHOR) toujinwen@jnu.edu.cn

Lähde: Naval Research Logistics. Apr2025, Vol. 72 Issue 3, p454-464. 11p.

Asiasanat: *SCHEDULING, *DEADLINES, *PARALLEL processing, *INTEGER programming, *ALGORITHMS, APPROXIMATION algorithms, GREEDY algorithms

Multi-objective simulation-optimization for a distribution center resource planning.

Tekijät: Li, Yan^1,2 (AUTHOR) ly.liyan@u.nus.edu, Yeo, Keng Swee, Steve^1,2 (AUTHOR), Li, Haobin^1,2 (AUTHOR), Chew, Ek Peng^1,2 (AUTHOR)

Lähde: IISE Transactions. Mar2025, p1-17. 17p. 11 Illustrations.

Asiasanat: *DISTRIBUTION planning, *RESOURCE allocation, *WAREHOUSES, EVOLUTIONARY algorithms, APPROXIMATION algorithms, STOCHASTIC approximation

On the correlation gap of matroids: On the correlation gap of matroids: E. Husić et al.

Tekijät: Husić, Edin¹ (AUTHOR) edin.husic@supsi.ch, Koh, Zhuan Khye² (AUTHOR) zhuan.koh@cwi.nl, Loho, Georg³ (AUTHOR) g.loho@utwente.nl, Végh, László A.⁴ (AUTHOR) l.vegh@lse.ac.uk

Lähde: Mathematical Programming. Mar2025, Vol. 210 Issue 1, p407-456. 50p.

Asiasanat: SUBMODULAR functions, APPROXIMATION algorithms, SET functions, CUBES, MATROIDS

Multi-objective route planning of an unmanned air vehicle in continuous terrain: An exact and an approximation algorithm.

Tekijät: Dasdemir, Erdi¹ (AUTHOR) edasdemir@hacettepe.edu.tr, Köksalan, Murat^2,3 (AUTHOR) koksalan@umich.edu, Tezcaner Öztürk, Diclehan¹ (AUTHOR) diclehanozturk@hacettepe.edu.tr

Lähde: European Journal of Operational Research. May2025, Vol. 322 Issue 3, p960-977. 18p.

Asiasanat: DRONE aircraft, APPROXIMATION algorithms, AUTONOMOUS vehicles, ALL terrain vehicles, RADAR

Minimizing total completion time and makespan for a multi-scenario bi-criteria parallel machine scheduling problem.

Tekijät: Zhang, Xiechen¹ (AUTHOR), Angel, Eric¹ (AUTHOR) eric.angel@univ-evry.fr, Chu, Feng¹ (AUTHOR), Regnault, Damien¹ (AUTHOR)

Lähde: European Journal of Operational Research. Mar2025, Vol. 321 Issue 2, p397-406. 10p.

Asiasanat: *COMPUTER science, *PRODUCTION scheduling, POLYNOMIAL time algorithms, APPROXIMATION algorithms, PARALLEL algorithms

Age of Information Diffusion on Social Networks

Tekijät: Li, S., Duan, L.

Lähde: IEEE Transactions on Networking IEEE Trans. Netw. Networking, IEEE Transactions on. 33(2):701-712 Apr, 2025

Toward a Better Understanding of Randomized Greedy Matching.

Tekijät: ZHIHAO GAVIN TANG¹ tang.zhihao@mail.shufe.edu.cn, XIAOWEI WU² xiaoweiwu@um.edu.mo, YUHAO ZHANG³ zhang_yuhao@sjtu.edu.cn

Lähde: Journal of the ACM. Dec2023, Vol. 70 Issue 6, p1-32. 32p.

Asiasanat: BIPARTITE graphs, APPROXIMATION algorithms, GREEDY algorithms, POLYNOMIAL time algorithms, ONLINE algorithms, GRAPH theory

Proof of the Theory-to-Practice Gap in Deep Learning via Sampling Complexity bounds for Neural Network Approximation Spaces.

Tekijät: Grohs, Philipp^1,2,3 (AUTHOR) philipp.grohs@univie.ac.at, Voigtlaender, Felix^1,4,5 (AUTHOR)

Lähde: Foundations of Computational Mathematics. Aug2024, Vol. 24 Issue 4, p1085-1143. 59p.

Asiasanat: *ARTIFICIAL neural networks, *APPROXIMATION algorithms, *COMPUTATIONAL complexity, *ALGORITHMS, *HARDNESS, *DEEP learning

Constructing Approximations to Bivariate Piecewise-Smooth Functions.

Tekijät: Levin, David¹ (AUTHOR) levin@tauex.tau.ac.il

Lähde: Axioms (2075-1680). Jul2024, Vol. 13 Issue 7, p428. 12p.

Asiasanat: *APPROXIMATION algorithms, *FUNCTION spaces, *SET functions, *SPLINES, *GEOMETRY

A constant-factor approximation for generalized malleable scheduling under M♮-concave processing speeds.

Tekijät: Fotakis, Dimitris¹ (AUTHOR), Matuschke, Jannik² (AUTHOR) jannik.matuschke@kuleuven.be, Papadigenopoulos, Orestis³ (AUTHOR)

Lähde: Mathematical Programming. Jul2024, Vol. 206 Issue 1/2, p515-539. 25p.

Asiasanat: *APPROXIMATION algorithms, *SCHEDULING, *UTILITY functions, *CONCAVE functions, *PRODUCTION scheduling

Approximation Algorithms for the MAXSPACE Advertisement Problem.

Tekijät: Pedrosa, Lehilton L. C.¹ (AUTHOR), da Silva, Mauro R. C.¹ (AUTHOR) mauro.silva@ic.unicamp.br, Schouery, Rafael C. S.¹ (AUTHOR)

Lähde: Theory of Computing Systems. Jun2024, Vol. 68 Issue 3, p571-590. 20p.

Asiasanat: *APPROXIMATION algorithms, *ADVERTISING

Pareto Optimization for Subset Selection via Steering Mutation With Theoretical Guarantee [Research Frontier]

Tekijät: Zhang, L., Wang, Z., Yang, H., Cheng, F.

Lähde: IEEE Computational Intelligence Magazine IEEE Comput. Intell. Mag. Computational Intelligence Magazine, IEEE. 20(2):80-94 May, 2025