An integer linear programming approach for bilinear integer programming.
Alexandre S. FreireEduardo MorenoJuan Pablo VielmaPublished in: Oper. Res. Lett. (2012)
Keyphrases
- integer programming
- np hard
- linear programming
- column generation
- lagrangian relaxation
- ai planning
- set covering problem
- valid inequalities
- constraint programming
- cutting plane algorithm
- transportation problem
- network flow
- production planning
- cutting plane
- facility location
- integer program
- set covering
- inference problems
- vehicle routing problem with time windows
- crew scheduling
- network design problem
- linear program
- dynamic programming
- special case
- optimal solution