A general branch-and-bound algorithm for fair division problems.
Rudolf VetscheraPublished in: Comput. Oper. Res. (2010)
Keyphrases
- branch and bound algorithm
- test problems
- randomly generated problems
- special case
- lower bound
- branch and bound
- optimal solution
- set covering problem
- finding an optimal solution
- randomly generated
- upper bound
- branch and bound method
- combinatorial optimization
- computational biology
- precedence constraints
- mixed integer linear programming
- max sat
- exact algorithms