Experimental study on the information disclosure problem: Branch-and-bound and QUBO solver.
Keisuke OtakiAkihisa OkadaHiroaki YoshidaPublished in: Frontiers Appl. Math. Stat. (2023)
Keyphrases
- experimental study
- branch and bound
- information disclosure
- tree search
- lower bound
- branch and bound algorithm
- search algorithm
- optimal solution
- search space
- combinatorial optimization
- column generation
- upper bound
- cost benefit
- branch and bound procedure
- experimental evaluation
- max sat
- tree search algorithm
- privacy concerns
- network design problem
- branch and bound method
- randomly generated problems
- search strategies
- max sat solver
- branch and bound search
- graphical models
- private information
- search tree
- evolutionary algorithm
- neural network