Výsledky vyhľadávania - (abstract OR abstrakty) computational complexity for mathematik programming problems*

Sparse Integer Programming Is Fixed-Parameter Tractable.

Autori: Eisenbrand, Friedrich Hunkenschröder, Christoph Klein, Kim-Manuel a ďalší

Zdroj: Mathematics of Operations Research; Aug2025, Vol. 50 Issue 3, p2141-2156, 16p

Predmety: INTEGER programming, COMPUTATIONAL complexity, POLYNOMIAL time algorithms, CONVEX functions, INTEGERS, ALGORITHMS

SAT requires exhaustive search.

Autori: Xu, Ke Zhou, Guangyan

Zdroj: Frontiers of Computer Science; Dec2025, Vol. 19 Issue 12, p1-14, 14p

Multilevel quadrature formulae for the optimal control of random PDEs.

Autori: Nobile, Fabio Vanzan, Tommaso

Zdroj: Numerische Mathematik; Dec2025, Vol. 157 Issue 6, p2291-2322, 32p

Predmety: OPTIMAL control theory, MONTE Carlo method, STOCHASTIC partial differential equations, NUMERICAL integration, ASYMPTOTIC analysis, LAGRANGE multiplier, NUMERICAL analysis, COMPUTATIONAL complexity

Complexity Theory.

Zdroj: Oberwolfach Reports; 2024, Vol. 21 Issue 2, p1517-1562, 46p

Predmety: COMPUTATIONAL complexity, CODING theory, COMBINATORICS, COMPLEXITY (Philosophy), ARITHMETIC

SMALL TERM REACHABILITY AND RELATED PROBLEMS FOR TERMINATING TERM REWRITING SYSTEMS.

Autori: BAADER, FRANZ GIESL, JURGEN

Zdroj: Logical Methods in Computer Science (LMCS); 2025, Vol. 21 Issue 4, p8:1-8:31, 1p

Predmety: COMPUTATIONAL complexity, MATHEMATICAL logic

2023 NORTH AMERICAN ANNUAL MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC University of California, Irvine Irvine, CA, USA March 25–29, 2023.

Zdroj: Bulletin of Symbolic Logic; Dec2024, Vol. 29 Issue 4, p672-695, 24p

Predmety: COMPUTATIONAL complexity, MATHEMATICAL equivalence, PROPOSITION (Logic), SET theory

Korporácia: ASSOCIATION for Symbolic Logic

Note on combinatorial optimization with max-linear objective functions

Autori: Francesco Maffioli Sung-Jin Chung Katta G. Murty a ďalší

Prispievatelia: Francesco Maffioli Sung-Jin Chung Katta G. Murty a ďalší

Zdroj: Discrete Applied Mathematics. 42:139-145

Predmety: Combinatorial optimization, max-linear combinatorial problem, Science, Applied Mathematics, strongly NP-hard, 0211 other engineering and technologies, 02 engineering and technology, lower bounds, multicriteria optimization, 0202 electrical engineering, electronic engineering, information engineering, branch-and-bound, Discrete Mathematics and Combinatorics, Abstract computational complexity for mathematical programming problems, Mathematics

Popis súboru: application/xml; 403402 bytes; 3118 bytes; application/pdf; text/plain

Prístupová URL adresa: https://www.sciencedirect.com/science/article/pii/0166218X9390043N
https://deepblue.lib.umich.edu/handle/2027.42/30833
https://deepblue.lib.umich.edu/bitstream/handle/2027.42/30833/0000495.pdf;sequence=1
https://www.sciencedirect.com/science/article/abs/pii/0166218X9390043N
https://dblp.uni-trier.de/db/journals/dam/dam42.html#ChungHMM93

Uniqueness in quadratic and hyperbolic 0–1 programming problems.

Autori: Deineko, Vladimir G. Klinz, Bettina Woeginger, Gerhard J.

Zdroj: Operations Research Letters. Nov2013, Vol. 41 Issue 6, p633-635. 3p.

Predmety: *OPTIMAL control theory, *MATHEMATICAL models, QUADRATIC programming, HYPERBOLIC functions, COMPUTATIONAL complexity, SET theory

RIEMANNIAN MULTIGRID LINE SEARCH FOR LOW-RANK PROBLEMS.

Autori: SUTTI, MARCO VANDEREYCKEN, BART

Zdroj: SIAM Journal on Scientific Computing; 2021, Vol. 43 Issue 3, pA1803-A1831, 29p

Predmety: LOW-rank matrices, ALGORITHMS, PROBLEM solving, SQUARE root, COMPUTATIONAL complexity, RIEMANNIAN manifolds, MULTIGRID methods (Numerical analysis)

SCORE-BASED PHYSICS-INFORMED NEURAL NETWORKS FOR HIGH-DIMENSIONAL FOKKER--PLANCK EQUATIONS.

Autori: ZHEYUAN HU ZHONGQIANG ZHANG KARNIADAKIS, GEORGE E. a ďalší

Zdroj: SIAM Journal on Scientific Computing; 2025, Vol. 47 Issue 3, pC680-C705, 39p

Predmety: FOKKER-Planck equation, STOCHASTIC differential equations, DIMENSIONAL analysis, NUMERICAL analysis, MACHINE learning, MONTE Carlo method

THE COMPLEXITY OF GENERIC PRIMAL ALGORITHMS FOR SOLVING GENERAL INTEGER PROGRAMS.

Autori: Schulz, Andreas S. Weismantel, Robert

Zdroj: Mathematics of Operations Research; Nov2002, Vol. 27 Issue 4, p681, 12p

Predmety: COMBINATORIAL optimization, INTEGER programming, ALGORITHMS, MATHEMATICAL optimization, POLYNOMIALS, COMPUTATIONAL complexity, VECTOR analysis

Single machine total tardiness maximization problems: complexity and algorithms.

Autori: Gafarov, Evgeny Lazarev, Alexander Werner, Frank

Zdroj: Annals of Operations Research; Aug2013, Vol. 207 Issue 1, p121-136, 16p, 1 Chart

Predmety: MACHINERY, TARDINESS, ALGORITHMS, DYNAMIC programming, COMPUTATIONAL complexity, CONSTRAINTS (Physics)

A note on the complexity of the transportation problem with a permutable demand vector.

Autori: Hujter, Mihály Klinz, Bettina Woeginger, Gerhard J.

Zdroj: Mathematical Methods of Operations Research; 1999, Vol. 50 Issue 1, p9, 8p

Predmety: TRANSPORTATION problems (Programming), COMPUTATIONAL complexity

NOTIONS OF TENSOR RANK.

Autori: JUVEKAR, MANDAR NADJIMZADAH, ARIAN

Zdroj: Online Journal of Analytic Combinatorics; 2023, Issue 18, p1-17, 17p

Predmety: COMPUTATIONAL complexity, FINITE fields, APPLICATION software, DATA analytics, COMPUTER science

Duality Gap in Interval Linear Programming.

Autori: Novotná, Jana Hladík, Milan Masařík, Tomáš

Zdroj: Journal of Optimization Theory & Applications; Feb2020, Vol. 184 Issue 2, p565-580, 16p

Predmety: COMPUTATIONAL complexity, INTERVAL analysis

Computational Complexity Theory and the Philosophy of Mathematics.

Autori: Dean, Walter

Zdroj: Philosophia Mathematica; Oct2019, Vol. 27 Issue 3, p381-439, 59p

Predmety: PHILOSOPHY of mathematics, COMPLEXITY (Philosophy), COMPUTATIONAL complexity, COMPUTABLE functions, COMPUTER science

Logical Foundations of Mathematics and Computational Complexity

Autori: Pavel Pudlák

Typ zdroja: eBook.

Predmet: Logic, Symbolic and mathematical, Computational complexity

Kategórie: MATHEMATICS / Logic, COMPUTERS / Programming / Algorithms, MATHEMATICS / Applied

A Multi-Objective Optimization Approach for Joint Channel Assignment and Multicast Routing in Multi-Radio Multi-Channel Wireless Mesh Networks.

Autori: Vaezpour, Elaheh Dehghan, Mehdi

Zdroj: Wireless Personal Communications; Jul2014, Vol. 77 Issue 2, p1055-1076, 22p

Predmety: WIRELESS mesh networks, GENETIC algorithms, NP-complete problems, ASSIGNMENT problems (Programming), COMPUTATIONAL complexity, COMPUTER networks

Reviews & Products: MATLAB (Computer software)

A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory.

Autori: Cai, Jin-Yi Fu, Zhiguo Girstmair, Kurt a ďalší

Zdroj: Computational Complexity; Jun2023, Vol. 32 Issue 1, p1-37, 37p

Stochastic programming approach to optimization under uncertainty.

Autori: Shapiro, Alexander

Zdroj: Mathematical Programming; Mar2008, Vol. 112 Issue 1, p183-220, 38p

Predmety: STOCHASTIC programming, DYNAMIC programming, MATHEMATICAL optimization, UNCERTAINTY (Information theory), MONTE Carlo method, COMPUTATIONAL complexity