Suchergebnisse - (abstract OR abstrakte) computational complexity for mathematik programming problems

Note on combinatorial optimization with max-linear objective functions

Autoren: Francesco Maffioli Sung-Jin Chung Katta G. Murty et al.

Weitere Verfasser: Francesco Maffioli Sung-Jin Chung Katta G. Murty et al.

Quelle: Discrete Applied Mathematics. 42:139-145

Schlagwörter: 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

Dateibeschreibung: application/xml; 403402 bytes; 3118 bytes; application/pdf; text/plain

Zugangs-URL: 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.

Autoren: Shapiro, Alexander

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

Schlagwörter: 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.

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

Schlagwörter: COMPUTATIONAL complexity, ALGORITHMS, COMPUTER programming, ALGEBRA, MACHINE theory

The Northwest corner rule revisited

Autoren: Klinz, Bettina Woeginger, Gerhard J.

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

Schlagwörter: *TRANSPORTATION problems (Programming), *PERMUTATIONS, *LINEAR programming, *COMPUTATIONAL complexity, *MATHEMATICAL analysis, *NP-complete problems

Generic Programming and Algebraic Multigrid for Stabilized Finite Element Methods ; Generisches Programmieren und Algebraische Mehrgitterverfahren für Stabilisierte Finite Elemente Methoden

Autoren: Klimanis, Nils Lube, Gert Prof. Dr. Schaback, Robert Prof. Dr. et al.

Weitere Verfasser: Klimanis, Nils Lube, Gert Prof. Dr. Schaback, Robert Prof. Dr. et al.

Schlagwörter: 510 Mathematik, Mathematics and Computer Science, Algebraische Mehrgitterverfahren, Navier-Stokes, Oseen, Generisches Programmieren, Generatives Programmieren, C++, Mixins, Templates, Finite Elemente, Algebraic Multigrid, Generic Programming, Generative Programming, Finite Elements, 31.76, 54.51, EGFF 100: Iterative methods for linear systems {Numerical analysis: Numerical linear algebra}, EGFM 550: Multigrid methods, domain decomposition {Numerical analysis: Partial differential equations, initial value and time-dependent initial-boundary value problems}, EGFM 600: Finite elements, Rayleigh-Ritz and Galerkin methods, finite methods {Numerical analysis: Partial differential equations, EGFN 220: Solution of discretized equations {Numerical analysis: Partial differential equations, boundary value problems}, EGFY 200: Complexity and performance of numerical algorithms {Numerical analysis: Computer aspects of numerical algorithms}, EGIN 190: Other programming techniques {Computer science: Software}, AHG 130: Numerical Linear Algebra {Mathematics of Computing. Numerical Analysis}, AHD 330: Language Constructs and Features {Computing. Programming Languages}

Dateibeschreibung: application/pdf

Relation: 550642552

Verfügbarkeit: http://hdl.handle.net/11858/00-1735-0000-0006-B38C-5
https://doi.org/10.53846/goediss-2448
https://nbn-resolving.org/urn:nbn:de:gbv:7-webdoc-1432-8

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

Autoren: Drewes, Sarah Pokutta, Sebastian

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

Schlagwörter: Cutting stock problem, Binary number system, Mathematical variables, Integer programming, Mathematical symmetry, Computational complexity

Language equations with complementation: Decision problems

Autoren: Okhotin, Alexander Yakimova, Oksana

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

Schlagwörter: *COMPUTER systems, *PROGRAMMING languages, *DECISION theory, *MATHEMATICAL models, *COMPUTER programming

Computational Complexity of Counting and Sampling

Autoren: Istvan Miklos

Resource Type: eBook.

Schlagworte: Sampling (Statistics), Computational complexity

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

Logical Foundations of Mathematics and Computational Complexity

Autoren: Pavel Pudlák

Resource Type: eBook.

Schlagworte: Logic, Symbolic and mathematical, Computational complexity

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

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

Autoren: Amaral, Vasco Helmer, Sven Moerkotte, Guido

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

Schlagwörter: *COMPUTATIONAL complexity, *QUERY languages (Computer science), *ABSTRACT thought, *ELECTRONIC data processing, *COMPUTER programming, *INFORMATION retrieval

Uniqueness in quadratic and hyperbolic 0–1 programming problems.

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

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

Schlagwörter: *OPTIMAL control theory, *MATHEMATICAL models, QUADRATIC programming, HYPERBOLIC functions, COMPUTATIONAL complexity, SET theory

Approximation algorithms for combinatorial multicriteria optimization problems.

Autoren: Ehrgott, Matthias

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

Schlagwörter: ALGORITHMS, APPROXIMATION theory, MATHEMATICAL optimization

Sparse Integer Programming Is Fixed-Parameter Tractable.

Autoren: Eisenbrand, Friedrich Hunkenschröder, Christoph Klein, Kim-Manuel et al.

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

Schlagwörter: INTEGER programming, COMPUTATIONAL complexity, POLYNOMIAL time algorithms, CONVEX functions, INTEGERS, ALGORITHMS

SAT requires exhaustive search.

Autoren: Xu, Ke Zhou, Guangyan

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

Multilevel quadrature formulae for the optimal control of random PDEs.

Autoren: Nobile, Fabio Vanzan, Tommaso

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

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

Computability and Complexity

Autoren: Hubie Chen

Resource Type: eBook.

Schlagworte: Computational complexity

Categories: COMPUTERS / Computer Science, COMPUTERS / Machine Theory, COMPUTERS / Programming / Algorithms

Complexity Theory.

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

Schlagwörter: COMPUTATIONAL complexity, CODING theory, COMBINATORICS, COMPLEXITY (Philosophy), ARITHMETIC

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

Autoren: BAADER, FRANZ GIESL, JURGEN

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

Schlagwörter: COMPUTATIONAL complexity, MATHEMATICAL logic

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

Autoren: Goshu, Natnael Nigussie Kassa, Semu Mitiku

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

Schlagwörter: STOCHASTIC programming, STATISTICAL sampling, MATHEMATICAL programming, PARTICLE swarm optimization, RANDOM variables

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

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

Schlagwörter: COMPUTATIONAL complexity, MATHEMATICAL equivalence, PROPOSITION (Logic), SET theory

Firma/Körperschaft: ASSOCIATION for Symbolic Logic