Separating Type-I Odd-Cycle Inequalities for a Binary-Encoded Edge-Coloring Formulation.
Jon LeeJanny LeungSven de VriesPublished in: J. Comb. Optim. (2005)
Keyphrases
- binary variables
- mixed integer
- valid inequalities
- cutting plane algorithm
- edge information
- random variables
- edge detection
- run length
- linear programming
- sufficient conditions
- edge detector
- knapsack problem
- non binary
- linear inequalities
- cutting plane
- linear program
- mixed integer programming
- multiple scales
- weighted graph
- type ii
- optimization procedure
- subtour elimination
- integer program
- semidefinite programming
- continuous variables
- image sequences
- fixed number
- hamming distance
- dynamic programming
- np hard
- support vector