Valid inequalities for binary linear codes.
Stefan RuzikaAkin TanatmisFrank KienleHorst W. HamacherNorbert WehnMayur PunekarPublished in: ISIT (2009)
Keyphrases
- valid inequalities
- integer programming
- mixed integer linear programs
- linear programming
- feasible solution
- traveling salesman problem
- mixed integer
- cutting plane algorithm
- continuous variables
- mixed integer programming
- cutting plane
- lower and upper bounds
- integer program
- convex hull
- facet defining inequalities
- network design problem
- column generation
- primal dual
- linear programming relaxation
- multi objective