A General Alternative Procedure for Solving Negative Degree of Difficulty Problems in Geometric Programming.
J. L. AlejandreAna AlluevaJose Miguel GonzalezPublished in: Comput. Optim. Appl. (2004)
Keyphrases
- solving problems
- special case
- problems involving
- solving complex
- np complete
- closely related
- benchmark problems
- evolutionary algorithm
- optimization problems
- specific problems
- combinatorial optimisation
- combinatorial optimization
- quadratic programming
- programming language
- quadratic program
- polynomial equations
- convex quadratic programming