Optimizing stimulus patterns for dense array TDCS with fewer sources than electrodes using a branch and bound algorithm.
Seyhmus GulerMoritz DannhauerBurak EremRobert S. MacLeodDon M. TuckerSergei TurovetsPhan LuuWaleed MeleisDana H. BrooksPublished in: ISBI (2016)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- optimal solution
- np hard
- randomly generated problems
- lower bounding
- combinatorial optimization
- single machine scheduling problem
- search tools
- lagrangian relaxation
- upper bounding
- search algorithm
- precedence constraints
- mixed integer linear programming
- variable ordering
- max sat
- relational databases
- branch and bound method
- maximum clique
- databases
- column generation
- approximation algorithms
- content analysis
- search space
- integer variables