Computationally Related Problems
From MaRDI portal
Cited in
(75)- Revisiting the complexity of and/or graph solution
- Complexity and algorithms for nonlinear optimization problems
- Spectral bounds for the clique and independence numbers of graphs
- Comparison of algorithms for simple stochastic games
- Integer equal flows
- Optimal systolic array algorithms for tensor product
- A polynomial algorithm for some instances of NP-complete problems
- Extensions of \(\mathrm{S}\)-lemma for noncommutative polynomial
- Optimization via rejection-free partial neighbor search
- The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two
- Simulation of discrete linear time-invariant fuzzy dynamic systems
- Embedding equality constraints of optimization problems into a quantum annealer
- Computability and randomness of Nash equilibrium in infinite games
- Non deterministic polynomial optimization problems and their approximations
- Quadratic programming is in NP
- Multi-market portfolio optimization with conditional value at risk
- Weighted Boolean formula games
- Deciding non-emptiness of hypergraph languages generated by connection-preserving fusion grammars is NP-complete
- A note on integral generalized flows in directed partial 2-trees
- ANALYZING VULNERABILITIES OF CRITICAL INFRASTRUCTURES USING FLOWS AND CRITICAL VERTICES IN AND/OR GRAPHS
- A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision
- How to calculate the barycenter of a weighted graph
- Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints
- And/or-convexity: a graph convexity based on processes and deadlock models
- Joint economic production allocation and ordering policies in a supply chain consisting of multiple plants and a single retailer
- PROCESSOR-TIME-OPTIMAL SYSTOLIC ARRAYS
- An efficient global algorithm for a class of indefinite separable quadratic programs
- SEA-PARAM: exploring schedulers in parametric MDPs
- Finding optimal satisficing strategies for and-or trees
- Exact worst-case performance of first-order methods for composite convex optimization
- On the optimal mixing problem of approximate Nash equilibria in bimatrix games
- Directed capacity-preserving subgraphs: hardness and exact polynomial algorithms
- Tractability, hardness, and kernelization lower bound for and/or graph solution
- Robust transshipment problem under consistent flow constraints
- On tail dependence matrices. The realization problem for parametric families
- A new algorithm for concave quadratic programming
- Minimal disclosure in hierarchical Hippocratic databases with delegation
- Capacity-preserving subgraphs of directed flow networks
- Finding a minimum equivalent graph of a digraph
- On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints
- Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution
- Relaxations of KKT conditions do not strengthen finite RLT and SDP-RLT bounds for nonconvex quadratic programs
- A study of piecewise linear-quadratic programs
- Canonical duality theory: connections between nonconvex mechanics and global optimization
- Generalized S-lemma and strong duality in nonconvex quadratic programming
- A graph theoretic approach to switching function minimization
- Level-planar drawings with few slopes
- A convergent conical algorithm with -bisection for concave minimization
- The contest game for crowdsourcing reviews
- Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
- Deterministic global optimization in ab-initio quantum chemistry
- New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming
- On approximation algorithms for concave mixed-integer quadratic programming
- Robust minimum cost flow problem under consistent flow constraints
- On approximation algorithms for concave mixed-integer quadratic programming
- Compact linearization for binary quadratic problems subject to assignment constraints
- Production allocation and shipment policies in a multiple-manufacturer–single-retailer supply chain
- Learning to optimize via posterior sampling
- A continuous knapsack problem with separable convex utilities: approximation algorithms and applications
- The complexity of computing KKT solutions of quadratic programs
- Topographic mapping of large dissimilarity data sets
- Optimization problems and the polynomial hierarchy
- scientific article; zbMATH DE number 3572042 (Why is no real title available?)
- A low and a high hierarchy within NP
- Probably approximately optimal satisficing strategies
- New model and heuristics for safety stock placement in general acyclic supply chain networks
- Approximation of the quadratic set covering problem
- On the parallel approximability of a subclass of quadratic programming.
- Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations
- Processor lower bound formulas for array computations and parametric Diophantine systems
- A complexity theory for feasible closure properties
- Generalized max flow in series-parallel graphs
- Redundancy in logic. II: 2CNF and Horn propositional formulae
- The contest game for crowdsourcing reviews
- Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint
This page was built for publication: Computationally Related Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5180395)
