A polynomial algorithm for some instances of NP-complete problems
From MaRDI portal
Cites work
- A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- Approximation algorithms for indefinite quadratic programming
- Computationally Related Problems
- Discrete and computational geometry. The Goodman-Pollack Festschrift
- Ellipsoidal approach to box-constrained quadratic problems
- scientific article; zbMATH DE number 757677 (Why is no real title available?)
- scientific article; zbMATH DE number 2209717 (Why is no real title available?)
- Linear Matrix Inequalities in System and Control Theory
- On Projection Algorithms for Solving Convex Feasibility Problems
- On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces
- On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls
- Solutions to quadratic minimization problems with box and integer constraints
- Stability of a convex feasibility problem
This page was built for publication: A polynomial algorithm for some instances of NP-complete problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6963631)
