A mixed-integer bilevel programming approach for a competitive prioritized set covering problem.
Mehdi HemmatiJ. Cole SmithPublished in: Discret. Optim. (2016)
Keyphrases
- mixed integer
- set covering problem
- bilevel programming
- column generation
- linear program
- set covering
- optimality conditions
- branch and bound algorithm
- optimal solution
- integer programming
- lot sizing
- convex programming
- linear programming
- convex hull
- bi objective
- feasible solution
- lower bound
- continuous variables
- branch and bound
- network flow
- integer program
- interior point methods
- nonlinear programming
- upper bound
- np hard
- finite number
- tabu search