A Branch and Bound Algorithm to Scale Alignment of Large Ontologies.
Suzette StoutenburgKaily EwingLisa HinesJugal KalitaPublished in: ICSC (2009)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- ontology matching
- upper bound
- lower bounding
- np hard
- ontology merging
- test problems
- randomly generated problems
- optimal solution
- combinatorial optimization
- mixed integer linear programming
- precedence constraints
- search tree
- max sat
- single machine scheduling problem
- dynamic time warping
- upper bounding
- lagrangian relaxation
- semantic web
- search algorithm
- neural network
- branch and bound method
- objective function
- finding an optimal solution
- variable ordering
- ontology mapping
- column generation
- metaheuristic