Branch and bound algorithms for the multidimensional assignment problem.
Eduardo L. PasiliaoPanos M. PardalosLeonidas S. PitsoulisPublished in: Optim. Methods Softw. (2005)
Keyphrases
- branch and bound algorithm
- np hard
- lower bound
- branch and bound
- upper bound
- optimal solution
- randomly generated
- search tree
- set covering problem
- variable ordering
- combinatorial optimization
- combinatorial problems
- haplotype inference
- multi dimensional
- boolean satisfiability
- special case
- finding an optimal solution
- np complete
- decision problems
- max sat
- knapsack problem
- approximation algorithms
- objective function
- search space
- programming language