Výsledky vyhledávání - "POLYNOMIAL time algorithms"

Flow-augmentation I: Directed graphs.

Autoři: Kim, Eun Jung Kratsch, Stefan Pilipczuk, Marcin a další

Zdroj: Journal of the ACM. Feb2025, Vol. 72 Issue 1, p1-38. 38p.

Témata: POLYNOMIAL time algorithms, GRAPH algorithms, CUTTING stock problem, INTEGERS, LOGICAL prediction, DIRECTED graphs

Geometric Embeddability of Complexes is ∃ℝ-complete.

Autoři: Abrahamsen, Mikkel Kleist, Linda Miltzow, Tillmann

Zdroj: Journal of the ACM. Feb2025, Vol. 72 Issue 1, p1-26. 26p.

Témata: *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.

Autoři: Seneviratne, Avin Walters, Peter L. Wang, Fei

Zdroj: Journal of Chemical Physics. 5/21/2025, Vol. 162 Issue 19, p1-16. 16p.

Témata: *POLYNOMIAL time algorithms, *QUANTUM theory, *PATH integrals, *ALGORITHMS

Reactive scheduling of uncertain jobs with maximum time lags.

Autoři: Györgyi, Péter Kis, Tamás Szögi, Evelin

Zdroj: European Journal of Operational Research. Oct2025, Vol. 326 Issue 1, p69-77. 9p.

Témata: *RENEWABLE natural resources, *SCHEDULING, POLYNOMIAL time algorithms, EVALUATION methodology

The Generalized Matrix Norm Problem.

Autoři: Kulmburg, Adrian¹ (AUTHOR) adrian.kulmburg@tum.de

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

Témata: *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.

Autoři: Matsumoto, Namiko Mazumdar, Arya

Zdroj: Journal of the ACM. Oct2024, Vol. 71 Issue 5, p1-64. 64p.

Témata: COMPRESSED sensing, POLYNOMIAL time algorithms, SUBGRADIENT methods, LENGTH measurement, APPROXIMATION error, ORTHOGONAL matching pursuit, THRESHOLDING algorithms

Killing a Vortex.

Autoři: Thilikos, Dimitrios M. Wiederrecht, Sebastian

Zdroj: Journal of the ACM. Aug2024, Vol. 71 Issue 4, p1-56. 56p.

Témata: POLYNOMIAL time algorithms, GRAPH algorithms, GENERATING functions, MINORS, COUNTING, BIPARTITE graphs

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

Autoři: Gajda, Mikele Boysen, Nils Gallay, Olivier

Zdroj: International Journal of Production Research. Sep2024, Vol. 62 Issue 17, p6360-6379. 20p.

Témata: 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.

Autoři: Yu, Renjie Oron, Daniel

Zdroj: European Journal of Operational Research. Jul2025, Vol. 324 Issue 1, p40-48. 9p.

Témata: *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.

Autoři: Zhang, Le Azadeh, Shadi Sharif Jiang, Hai

Zdroj: European Journal of Operational Research. Jul2025, Vol. 324 Issue 1, p183-199. 17p.

Témata: *SEARCH algorithms, POLYNOMIAL time algorithms, HEURISTIC algorithms, GREEDY algorithms, LOGISTIC regression analysis

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

Autoři: Garajová, Elif Rada, Miroslav

Zdroj: Central European Journal of Operations Research. Sep2025, Vol. 33 Issue 3, p819-834. 16p.

Témata: *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.

Autoři: Li, Shuguang Wei, Jing Sun, Yong a další

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

Témata: *PRODUCTION scheduling, *ALGORITHMS, POLYNOMIAL time algorithms

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

Autoři: Hirai, Hiroshi Iwamasa, Yuni Oki, Taihei a další

Zdroj: Mathematical Programming. Sep2025, Vol. 213 Issue 1/2, p941-984. 44p.

Témata: COMBINATORIAL optimization, POLYNOMIAL time algorithms, ASSIGNMENT problems (Programming), DUALITY theory (Mathematics), MATRICES (Mathematics), NONCOMMUTATIVE algebras

The mixed integer trust region problem.

Autoři: Del Pia, Alberto¹ (AUTHOR) delpia@wisc.edu

Zdroj: Mathematical Programming. Sep2025, Vol. 213 Issue 1/2, p699-736. 38p.

Témata: *NONLINEAR programming, *MATHEMATICAL optimization, *INTEGER programming, NP-hard problems, POLYNOMIAL time algorithms, INTEGERS, QUADRATIC forms, QUADRATIC programming

Dyadic linear programming and extensions.

Autoři: Abdi, Ahmad Cornuéjols, Gérard Guenin, Bertrand a další

Zdroj: Mathematical Programming. Sep2025, Vol. 213 Issue 1/2, p473-516. 44p.

Témata: *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.

Autoři: Astaoui, Walid Magnouche, Youcef Martin, Sébastien

Zdroj: Annals of Operations Research. Aug2025, Vol. 351 Issue 1, p849-881. 33p.

Témata: SPANNING trees, POLYNOMIAL time algorithms, NUMERICAL calculations, GRAPH theory, MATROIDS

A TIGHT ANALYSIS OF BETHE APPROXIMATION FOR PERMANENT.

Autoři: ANARI, NIMA REZAEI, ALIREZA

Zdroj: SIAM Journal on Computing. 2025, Vol. 54 Issue 4, p81-101. 21p.

Témata: *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.

Autoři: Del Pia, Alberto¹ (AUTHOR) delpia@wisc.edu

Zdroj: SIAM Journal on Optimization. 2025, Vol. 35 Issue 3, p1822-1845. 24p.

Témata: MIXED integer linear programming, POLYNOMIAL time algorithms, AFFINE transformations, COMPUTATIONAL complexity, CONVEX sets, POLYHEDRA

Spectral density modulation and universal Markovian closure of fermionic environments.

Autoři: Ferracin, Davide Smirne, Andrea Huelga, Susana F. a další

Zdroj: Journal of Chemical Physics. 11/7/2024, Vol. 161 Issue 17, p1-22. 22p.

Témata: *TIME complexity, *POLYNOMIAL time algorithms, *SPECTRAL energy distribution, *ALGORITHMS, *COLLECTIONS

Choiceless Polynomial Time with Witnessed Symmetric Choice.

Autoři: Lichter, Moritz Schweitzer, Pascal

Zdroj: Journal of the ACM. Apr2024, Vol. 71 Issue 2, p1-70. 70p.

Témata: POLYNOMIAL time algorithms, SYMMETRIC operators, AUTOMORPHISMS, ORBITS (Astronomy), CANONIZATION