Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron.
Fatiha BendaliJean MailfertPublished in: J. Comb. Optim. (2009)
Keyphrases
- extreme points
- linear relaxation
- linear program
- linear constraints
- linear programming
- np hard
- optimal solution
- column generation
- finite number
- geometric properties
- knapsack problem
- set partitioning
- primal dual
- dynamic programming
- minimum cost
- mixed integer
- interior point methods
- connected components
- objective function
- search space
- integer program
- undirected graph
- learning algorithm
- feasible solution
- convex sets
- infinite dimensional
- relaxation algorithm
- graph theoretic
- evolutionary algorithm
- random graphs
- valid inequalities
- special case
- worst case