A mixed integer programming formulation for the 1-maximin problem.
Serpil SayinPublished in: J. Oper. Res. Soc. (2000)
Keyphrases
- integer programming formulation
- randomly generated
- valid inequalities
- randomly generated problems
- linear programming relaxation
- tabu search algorithm
- upper bound
- branch and bound algorithm
- lower and upper bounds
- lp relaxation
- linear programming
- branch and bound
- traveling salesman problem
- np complete
- boolean functions
- convex hull
- search space