Flow-augmentation I: Directed graphs.

Συγγραφείς: Kim, Eun Jung¹ (AUTHOR) eunjungkim78@gmail.com, Kratsch, Stefan² (AUTHOR) kratsch@informatik.hu-berlin.de, Pilipczuk, Marcin³ (AUTHOR) malcin@mimuw.edu.pl, Wahlström, Magnus⁴ (AUTHOR) Magnus.Wahlstrom@rhul.ac.uk

Πηγή: Journal of the ACM. Feb2025, Vol. 72 Issue 1, p1-38. 38p.

Θεματικοί όροι: POLYNOMIAL time algorithms, GRAPH algorithms, CUTTING stock problem, INTEGERS, LOGICAL prediction, DIRECTED graphs

Geometric Embeddability of Complexes is ∃ℝ-complete.

Συγγραφείς: Abrahamsen, Mikkel¹ (AUTHOR) miab@di.ku.dk, Kleist, Linda² (AUTHOR) kleist@cs.uni-potsdam.de, Miltzow, Tillmann³ (AUTHOR) t.miltzow@uu.nl

Πηγή: Journal of the ACM. Feb2025, Vol. 72 Issue 1, p1-26. 26p.

Θεματικοί όροι: *STATISTICAL decision making, POLYNOMIAL time algorithms, COMPUTATIONAL topology, COMPUTATIONAL complexity, NP-hard problems

Quantum algorithm for the simulation of non-Markovian quantum dynamics using Feynman–Vernon influence functional.

Συγγραφείς: Seneviratne, Avin¹ (AUTHOR), Walters, Peter L.² (AUTHOR), Wang, Fei^2,3 (AUTHOR) fwang22@gmu.edu

Πηγή: Journal of Chemical Physics. 5/21/2025, Vol. 162 Issue 19, p1-16. 16p.

Θεματικοί όροι: *POLYNOMIAL time algorithms, *QUANTUM theory, *PATH integrals, *ALGORITHMS

A new and faster representation for counting integer points in parametric polyhedra.

Συγγραφείς: Gribanov, Dmitry V.^1,2 (AUTHOR) dimitry.gribanov@gmail.com, Malyshev, Dmitry S.² (AUTHOR) dsmalyshev@rambler.ru, Pardalos, Panos M.³ (AUTHOR) panos.pardalos@gmail.com, Zolotykh, Nikolai Yu.⁴ (AUTHOR) nikolai.zolotykh@itmm.unn.ru

Πηγή: Computational Optimization & Applications. Dec2025, Vol. 92 Issue 3, p811-861. 51p.

Θεματικοί όροι: POLYNOMIAL time algorithms, POLYTOPES, SPARSE matrices, MATHEMATICAL functions, CARDINAL numbers, OPTIMIZATION algorithms

Reactive scheduling of uncertain jobs with maximum time lags.

Συγγραφείς: Györgyi, Péter¹ (AUTHOR) gyorgyi.peter@sztaki.hun-ren.hu, Kis, Tamás^1,2 (AUTHOR) kis.tamas@sztaki.hun-ren.hu, Szögi, Evelin^1,2 (AUTHOR) szogievelin00@gmail.com

Πηγή: European Journal of Operational Research. Oct2025, Vol. 326 Issue 1, p69-77. 9p.

Θεματικοί όροι: *RENEWABLE natural resources, *SCHEDULING, POLYNOMIAL time algorithms, EVALUATION methodology

The Generalized Matrix Norm Problem.

Συγγραφείς: Kulmburg, Adrian¹ (AUTHOR) adrian.kulmburg@tum.de

Πηγή: SIAM Journal on Matrix Analysis & Applications. 2025, Vol. 46 Issue 4, p2226-2252. 27p.

Θεματικοί όροι: *MATHEMATICAL optimization, MATRIX norms, POLYNOMIAL time algorithms, REPRODUCIBLE research, COMPUTABLE analysis, DUALITY theory (Mathematics)

Binary Iterative Hard Thresholding Converges with Optimal Number of Measurements for 1-Bit Compressed Sensing.

Συγγραφείς: Matsumoto, Namiko¹ (AUTHOR) nmatsumo@ucsd.edu, Mazumdar, Arya² (AUTHOR) arya@ucsd.edu

Πηγή: Journal of the ACM. Oct2024, Vol. 71 Issue 5, p1-64. 64p.

Θεματικοί όροι: COMPRESSED sensing, POLYNOMIAL time algorithms, SUBGRADIENT methods, LENGTH measurement, APPROXIMATION error, ORTHOGONAL matching pursuit, THRESHOLDING algorithms

Killing a Vortex.

Συγγραφείς: Thilikos, Dimitrios M.¹ (AUTHOR) sedthilk@thilikos.info, Wiederrecht, Sebastian² (AUTHOR) sebastian.wiederrecht@gmail.com

Πηγή: Journal of the ACM. Aug2024, Vol. 71 Issue 4, p1-56. 56p.

Θεματικοί όροι: POLYNOMIAL time algorithms, GRAPH algorithms, GENERATING functions, MINORS, COUNTING, BIPARTITE graphs

Impact of bot return policies in van-and-bot delivery systems.

Συγγραφείς: Gajda, Mikele¹ (AUTHOR) Mikele.Gajda@unil.ch, Boysen, Nils² (AUTHOR), Gallay, Olivier¹ (AUTHOR)

Πηγή: International Journal of Production Research. Sep2024, Vol. 62 Issue 17, p6360-6379. 20p.

Θεματικοί όροι: CITY traffic, POLYNOMIAL time algorithms, SMART cities, BIPARTITE graphs, AUTONOMOUS robots

Single-machine scheduling with fixed energy recharging times to minimize the number of late jobs and the number of just-in-time jobs: A parameterized complexity analysis.

Συγγραφείς: Yu, Renjie¹ (AUTHOR), Oron, Daniel¹ (AUTHOR) daniel.oron@sydney.edu.au

Πηγή: European Journal of Operational Research. Jul2025, Vol. 324 Issue 1, p40-48. 9p.

Θεματικοί όροι: *ENERGY consumption, *RENEWABLE energy sources, *JOB shops, *SCHEDULING, POLYNOMIAL time algorithms, NATURAL numbers

Exact and heuristic algorithms for cardinality-constrained assortment optimization problem under the cross-nested logit model.

Συγγραφείς: Zhang, Le¹ (AUTHOR), Azadeh, Shadi Sharif² (AUTHOR), Jiang, Hai¹ (AUTHOR) haijiang@tsinghua.edu.cn

Πηγή: European Journal of Operational Research. Jul2025, Vol. 324 Issue 1, p183-199. 17p.

Θεματικοί όροι: *SEARCH algorithms, POLYNOMIAL time algorithms, HEURISTIC algorithms, GREEDY algorithms, LOGISTIC regression analysis

Complexity of computing the worst optimal value of interval transportation problems.

Συγγραφείς: Garajová, Elif^1,2 (AUTHOR) elif.garajova@vse.cz, Rada, Miroslav^2,3 (AUTHOR) miroslav.rada@vse.cz

Πηγή: Central European Journal of Operations Research. Sep2025, Vol. 33 Issue 3, p819-834. 16p.

Θεματικοί όροι: *MATHEMATICAL models, *LINEAR programming, POLYNOMIAL time algorithms, INTERVAL analysis, BILEVEL programming

Optimizing two-agent single-machine parallel batch scheduling: achieving pareto efficiency in makespan and maximum cost objectives.

Συγγραφείς: Li, Shuguang¹ (AUTHOR) sgliytu@hotmail.com, Wei, Jing¹ (AUTHOR), Sun, Yong¹ (AUTHOR), Noel Irangabiye, Armand Jean¹ (AUTHOR)

Πηγή: RAIRO: Operations Research (2804-7303). 2025, Vol. 59 Issue 4, p2219-2240. 22p.

Θεματικοί όροι: *PRODUCTION scheduling, *ALGORITHMS, POLYNOMIAL time algorithms

Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices.

Συγγραφείς: Hirai, Hiroshi¹ (AUTHOR) hirai.hiroshi@math.nagoya-u.ac.jp, Iwamasa, Yuni² (AUTHOR) iwamasa@i.kyoto-u.ac.jp, Oki, Taihei³ (AUTHOR) oki@icredd.hokudai.ac.jp, Soma, Tasuku⁴ (AUTHOR) soma@ism.ac.jp

Πηγή: Mathematical Programming. Sep2025, Vol. 213 Issue 1/2, p941-984. 44p.

Θεματικοί όροι: COMBINATORIAL optimization, POLYNOMIAL time algorithms, ASSIGNMENT problems (Programming), DUALITY theory (Mathematics), MATRICES (Mathematics), NONCOMMUTATIVE algebras

The mixed integer trust region problem.

Συγγραφείς: Del Pia, Alberto¹ (AUTHOR) delpia@wisc.edu

Πηγή: Mathematical Programming. Sep2025, Vol. 213 Issue 1/2, p699-736. 38p.

Θεματικοί όροι: *NONLINEAR programming, *MATHEMATICAL optimization, *INTEGER programming, NP-hard problems, POLYNOMIAL time algorithms, INTEGERS, QUADRATIC forms, QUADRATIC programming

Dyadic linear programming and extensions.

Συγγραφείς: Abdi, Ahmad¹ (AUTHOR) a.abdi1@lse.ac.uk, Cornuéjols, Gérard² (AUTHOR), Guenin, Bertrand³ (AUTHOR), Tunçel, Levent³ (AUTHOR)

Πηγή: Mathematical Programming. Sep2025, Vol. 213 Issue 1/2, p473-516. 44p.

Θεματικοί όροι: *LINEAR programming, *PROBLEM solving, *ALGORITHMS, POLYNOMIAL time algorithms, NUMERICAL calculations, RATIONAL numbers, FLOATING-point arithmetic

On the k-maximally-disjoint weighted spanning trees problem: variants, complexity and algorithms.

Συγγραφείς: Astaoui, Walid¹ (AUTHOR) walid.astaoui@huawei.com, Magnouche, Youcef¹ (AUTHOR) youcef.magnouche@huawei.com, Martin, Sébastien¹ (AUTHOR) sebastien.martin@huawei.com

Πηγή: Annals of Operations Research. Aug2025, Vol. 351 Issue 1, p849-881. 33p.

Θεματικοί όροι: SPANNING trees, POLYNOMIAL time algorithms, NUMERICAL calculations, GRAPH theory, MATROIDS

A TIGHT ANALYSIS OF BETHE APPROXIMATION FOR PERMANENT.

Συγγραφείς: ANARI, NIMA¹ anari@cs.stanford.edu, REZAEI, ALIREZA² arezaei@cs.washington.edu

Πηγή: SIAM Journal on Computing. 2025, Vol. 54 Issue 4, p81-101. 21p.

Θεματικοί όροι: *MATHEMATICS, NONNEGATIVE matrices, POLYNOMIAL time algorithms, APPROXIMATION algorithms, MATHEMATICAL proofs, MATHEMATICAL inequalities, APPROXIMATION error

Convex Quadratic Sets and the Complexity of Mixed Integer Convex Quadratic Programming.

Συγγραφείς: Del Pia, Alberto¹ (AUTHOR) delpia@wisc.edu

Πηγή: SIAM Journal on Optimization. 2025, Vol. 35 Issue 3, p1822-1845. 24p.

Θεματικοί όροι: MIXED integer linear programming, POLYNOMIAL time algorithms, AFFINE transformations, COMPUTATIONAL complexity, CONVEX sets, POLYHEDRA

Spectral density modulation and universal Markovian closure of fermionic environments.

Συγγραφείς: Ferracin, Davide¹ (AUTHOR) davide.ferracin@unimi.it, Smirne, Andrea^1,2 (AUTHOR), Huelga, Susana F.³ (AUTHOR), Plenio, Martin B.³ (AUTHOR), Tamascelli, Dario^1,3 (AUTHOR)

Πηγή: Journal of Chemical Physics. 11/7/2024, Vol. 161 Issue 17, p1-22. 22p.

Θεματικοί όροι: *TIME complexity, *POLYNOMIAL time algorithms, *SPECTRAL energy distribution, *ALGORITHMS, *COLLECTIONS