The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut.
Fatiha BendaliIbrahima DiarrassoubaMohamed Didi BihaAli Ridha MahjoubJean MailfertPublished in: DRCN (2007)
Keyphrases
- valid inequalities
- integer programming
- mixed integer programming
- linear programming
- traveling salesman problem
- mixed integer linear programs
- lower and upper bounds
- mixed integer
- cutting plane
- cutting plane algorithm
- randomly generated problems
- feasible solution
- column generation
- convex hull
- linear programming relaxation
- np hard
- network design problem
- primal dual
- integer program
- integer programming formulation
- facet defining inequalities
- lagrangian relaxation
- linear program
- genetic algorithm
- facet defining
- lower bound
- convergence rate
- branch and bound
- search space
- optimal solution