The transportation problem with exclusionary side constraints and two branch-and-bound algorithms.
Minghe SunPublished in: Eur. J. Oper. Res. (2002)
Keyphrases
- transportation problem
- branch and bound algorithm
- branch and bound
- lower bound
- fixed charge
- combinatorial problems
- randomly generated
- integer programming
- set covering problem
- upper bound
- constraint satisfaction
- optimal solution
- haplotype inference
- variable ordering
- combinatorial optimization
- np hard
- search tree
- dynamic programming
- linear constraints
- finding an optimal solution
- search space
- valid inequalities
- mixed integer
- lower and upper bounds