Some NP-complete problems in quadratic and nonlinear programming.
Katta G. MurtySantosh N. KabadiPublished in: Math. Program. (1987)
Keyphrases
- nonlinear programming
- np complete problems
- quadratic function
- np complete
- graph coloring
- phase transition
- linear programming
- optimization problems
- variational inequalities
- linear constraints
- hard problems
- objective function
- sat problem
- computational complexity
- semidefinite programming
- np hard
- exact algorithms
- job shop scheduling
- temporal logic
- neural network
- knapsack problem
- cellular automata