Pages that link to "Item:Q4637509"
From MaRDI portal
The following pages link to LP Formulations for Polynomial Optimization Problems (Q4637509):
Displaying 15 items.
- Extended formulations for vertex cover (Q1790198) (← links)
- Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
- New limits of treewidth-based tractability in optimization (Q2118087) (← links)
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (Q2146997) (← links)
- A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} Time (Q2164684) (← links)
- Exploiting sparsity for the min \(k\)-partition problem (Q2175445) (← links)
- On the impact of running intersection inequalities for globally solving polynomial optimization problems (Q2195679) (← links)
- Strong NP-hardness of AC power flows feasibility (Q2294366) (← links)
- A fast algorithm for the semi-definite relaxation of the state estimation problem in power grids (Q2338485) (← links)
- The Running Intersection Relaxation of the Multilinear Polytope (Q4958553) (← links)
- Principled deep neural network training through linear programming (Q6054389) (← links)
- On optimization problems in acyclic hypergraphs (Q6161450) (← links)
- On the complexity of binary polynomial optimization over acyclic hypergraphs (Q6174810) (← links)
- A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} time (Q6589758) (← links)
- A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs (Q6608035) (← links)
