The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations.
Elder Magalhães MacambiraCid Carvalho de SouzaPublished in: Eur. J. Oper. Res. (2000)
Keyphrases
- valid inequalities
- convex hull
- facet defining
- facet defining inequalities
- integer programming
- weighted graph
- traveling salesman problem
- linear programming
- mixed integer
- lower and upper bounds
- feasible solution
- cutting plane algorithm
- cutting plane
- mixed integer programming
- mixed integer linear programs
- linear programming relaxation
- integer programming formulation
- column generation
- network design problem
- integer program
- dynamic programming
- integer programming problems
- metaheuristic
- continuous variables
- tabu search
- shortest path
- optimization problems
- denoising
- upper bound
- probabilistic model