Formulations and valid inequalities for the node capacitated graph partitioning problem.
Carlos Eduardo FerreiraAlexander MartinC. Carvalho de SouzaRobert WeismantelLaurence A. WolseyPublished in: Math. Program. (1996)
Keyphrases
- valid inequalities
- graph partitioning
- fixed charge
- network design problem
- integer programming
- mixed integer programming
- traveling salesman problem
- mixed integer
- lower and upper bounds
- linear programming
- lot sizing
- cutting plane
- convex hull
- graph model
- feasible solution
- image segmentation
- column generation
- np hard
- primal dual
- clustering algorithm
- weighted graph
- integer program
- data clustering
- routing problem
- graph structure
- lagrangian relaxation
- continuous variables
- lower bound
- directed graph
- multistage
- upper bound
- spectral clustering
- np complete
- k means
- optimal solution
- convex optimization