Preprocessing rules for integer programming solutions to the generalised assignment problem.
M.-T. KongN. ShahPublished in: J. Oper. Res. Soc. (2001)
Keyphrases
- integer programming
- preprocessing
- np hard
- linear programming
- integer programming formulations
- ai planning
- optimal solution
- constraint programming
- production planning
- set covering problem
- lagrangian relaxation
- column generation
- network flow
- valid inequalities
- cutting plane
- integer program
- set covering
- facility location
- transportation problem
- association rules
- crew scheduling
- special case
- vehicle routing problem with time windows
- feasible solution
- cutting plane algorithm
- np complete
- heuristic methods
- network design problem
- approximation algorithms
- set partitioning