Using contracted solution graphs for solving reconfiguration problems.
Paul S. BonsmaDaniël PaulusmaPublished in: Acta Informatica (2019)
Keyphrases
- sparse linear systems
- linear systems
- exact solution
- combinatorial optimisation
- algebraic equations
- previously solved
- combinatorial optimization
- solving problems
- partial solutions
- constraint problems
- quadratic programming
- finding the shortest path
- linear equations
- solving complex
- finding an optimal solution
- np complete problems
- np complete
- max cut
- quadratic program
- backtracking algorithm
- nonlinear equations
- mixed integer program
- genetic algorithm
- approximate solutions
- optimization problems