Výsledky vyhledávání - Abstract computational complexity for mathematik programming problems

Note on combinatorial optimization with max-linear objective functions

Autoři: Francesco Maffioli Sung-Jin Chung Katta G. Murty a další

Přispěvatelé: Francesco Maffioli Sung-Jin Chung Katta G. Murty a další

Zdroj: Discrete Applied Mathematics. 42:139-145

Témata: 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 souboru: application/xml; 403402 bytes; 3118 bytes; application/pdf; text/plain

Pří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

Stochastic programming approach to optimization under uncertainty.

Autoři: Shapiro, Alexander

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

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

Exploiting bounded signal flow for graph orientation based on cause-effect pairs.

Zdroj: Algorithms for Molecular Biology; 2011, Vol. 6 Issue 1, p21-32, 12p, 1 Diagram, 2 Charts

Témata: COMPUTATIONAL complexity, ALGORITHMS, COMPUTER programming, ALGEBRA, MACHINE theory

The Northwest corner rule revisited

Autoři: Klinz, Bettina Woeginger, Gerhard J.

Zdroj: Discrete Applied Mathematics. Jul2011, Vol. 159 Issue 12, p1284-1289. 6p.

Témata: *TRANSPORTATION problems (Programming), *PERMUTATIONS, *LINEAR programming, *COMPUTATIONAL complexity, *MATHEMATICAL analysis, *NP-complete problems

Uniqueness in quadratic and hyperbolic 0–1 programming problems.

Autoři: Deineko, Vladimir G. Klinz, Bettina Woeginger, Gerhard J.

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

Témata: *OPTIMAL control theory, *MATHEMATICAL models, QUADRATIC programming, HYPERBOLIC functions, COMPUTATIONAL complexity, SET theory

Cutting-planes for weakly-coupled 0/1 second order cone programs

Autoři: Drewes, Sarah Pokutta, Sebastian

Zdroj: Electronic Notes in Discrete Mathematics. Aug2010, Vol. 36, p735-742. 8p.

Témata: Cutting stock problem, Binary number system, Mathematical variables, Integer programming, Mathematical symmetry, Computational complexity

Language equations with complementation: Decision problems

Autoři: Okhotin, Alexander Yakimova, Oksana

Zdroj: Theoretical Computer Science. May2007, Vol. 376 Issue 1/2, p112-126. 15p.

Témata: *COMPUTER systems, *PROGRAMMING languages, *DECISION theory, *MATHEMATICAL models, *COMPUTER programming

Engineering a New Abstraction Layer to Optimize the HEP Analysis Process.

Autoři: Amaral, Vasco Helmer, Sven Moerkotte, Guido

Zdroj: IEEE Transactions on Nuclear Science. Aug2004 Part 1 of 2, Vol. 51 Issue 4, p1441-1448. 8p.

Témata: *COMPUTATIONAL complexity, *QUERY languages (Computer science), *ABSTRACT thought, *ELECTRONIC data processing, *COMPUTER programming, *INFORMATION retrieval

Logical Foundations of Mathematics and Computational Complexity

Autoři: Pavel Pudlák

Resource Type: eBook.

Témata: Logic, Symbolic and mathematical, Computational complexity

Categories: MATHEMATICS / Logic, COMPUTERS / Programming / Algorithms, MATHEMATICS / Applied

Computational Complexity of Counting and Sampling

Autoři: Istvan Miklos

Resource Type: eBook.

Témata: Sampling (Statistics), Computational complexity

Categories: MATHEMATICS / General, MATHEMATICS / Arithmetic, MATHEMATICS / Combinatorics

Approximation algorithms for combinatorial multicriteria optimization problems.

Autoři: Ehrgott, Matthias

Zdroj: International Transactions in Operational Research; Jan2000, Vol. 7 Issue 1, p5, 27p

Témata: ALGORITHMS, APPROXIMATION theory, MATHEMATICAL optimization

Sparse Integer Programming Is Fixed-Parameter Tractable.

Autoři: Eisenbrand, Friedrich Hunkenschröder, Christoph Klein, Kim-Manuel a další

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

Témata: INTEGER programming, COMPUTATIONAL complexity, POLYNOMIAL time algorithms, CONVEX functions, INTEGERS, ALGORITHMS

SAT requires exhaustive search.

Autoři: 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.

Autoři: Nobile, Fabio Vanzan, Tommaso

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

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

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

Autoři: Schulz, Andreas S. Weismantel, Robert

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

Témata: *INTEGER programming, *ALGORITHMS, *MATHEMATICAL optimization, COMBINATORIAL optimization, POLYNOMIALS, COMPUTATIONAL complexity, VECTOR analysis

Complexity Theory.

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

Témata: COMPUTATIONAL complexity, CODING theory, COMBINATORICS, COMPLEXITY (Philosophy), ARITHMETIC

A solution method for stochastic multilevel programming problems. A systematic sampling evolutionary approach.

Autoři: Goshu, Natnael Nigussie Kassa, Semu Mitiku

Zdroj: Operations Research & Decisions; 2024, Vol. 34 Issue 1, p149-174, 26p

Témata: STOCHASTIC programming, STATISTICAL sampling, MATHEMATICAL programming, PARTICLE swarm optimization, RANDOM variables

A Package of Procedures and Functions for Construction and Inversion of Analytic Mappings with Unit Jacobian.

Autoři: Sadykov, T. M.

Zdroj: Programming & Computer Software; Feb2023, Vol. 49 Issue 1, p54-60, 7p

Témata: ANALYTIC mappings, ABSTRACT algebra, COMPUTER systems, COMPUTATIONAL complexity, POLYNOMIALS, JACOBIAN matrices

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

Témata: COMPUTATIONAL complexity, MATHEMATICAL equivalence, PROPOSITION (Logic), SET theory

Korporace: ASSOCIATION for Symbolic Logic

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

Autoři: Hujter, Mihály Klinz, Bettina Woeginger, Gerhard J.

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

Témata: TRANSPORTATION problems (Programming), COMPUTATIONAL complexity