On the Linear Relaxation of the 2-node Connected Subgraph Polytope.
Ali Ridha MahjoubCharles NocqPublished in: Discret. Appl. Math. (1999)
Keyphrases
- linear relaxation
- valid inequalities
- knapsack problem
- directed graph
- minimum cost
- linear program
- column generation
- convex hull
- set partitioning
- linear constraints
- relaxation algorithm
- np hard
- integer programming
- random graphs
- linear programming
- graph mining
- evolutionary algorithm
- soft constraints
- linear programming relaxation
- feasible solution
- traveling salesman problem
- graph theory
- lower and upper bounds
- mixed integer
- approximation algorithms
- mixed integer programming
- data points
- constant factor