Certificates and relaxations for integer programming and the semi-group membership problem
Jean B. LasserreEduardo S. ZeronPublished in: CoRR (2009)
Keyphrases
- integer programming
- group membership
- np hard
- linear programming
- linear programming relaxation
- cutting plane
- record linkage
- lp relaxation
- lower bound
- ai planning
- lagrangian relaxation
- production planning
- valid inequalities
- linear program
- set covering
- cutting plane algorithm
- constraint programming
- set covering problem
- special case
- public key
- computational complexity
- column generation
- approximation algorithms
- inference problems
- semidefinite
- transportation problem
- set partitioning
- feasible solution
- access control
- np complete
- vehicle routing problem with time windows
- facility location
- network flow
- primal dual
- structured data
- learning algorithm
- branch and bound algorithm
- convex relaxation
- knapsack problem
- integer program
- dynamic programming