On an algorithm solving two-level programming problems with nonunique lower level solutions.
Stephan DempeH. SchmidtPublished in: Comput. Optim. Appl. (1996)
Keyphrases
- benchmark problems
- lower level
- combinatorial optimization
- optimal or near optimal
- np hard
- optimal solution
- higher level
- search algorithm for solving
- combinatorial optimisation
- objective function
- approximate solutions
- optimality conditions
- linear systems
- exact solution
- constrained problems
- test problems
- learning algorithm
- optimization problems
- computational complexity
- optimization algorithm
- exact algorithms
- machine learning
- convex quadratic programming
- quadratic optimization problems
- ant colony optimization
- linear programming
- low level
- k means
- search space
- lower bound
- computer science
- previously solved
- finding optimal solutions