On a partition LP relaxation for min-cost 2-node connected spanning subgraphs.
Logan GroutJoseph CheriyanBundit LaekhanukitPublished in: Oper. Res. Lett. (2023)
Keyphrases
- max flow
- min cut
- min cost
- lp relaxation
- energy minimization
- linear programming
- network flow
- undirected graph
- knapsack problem
- message passing
- linear program
- integer programming
- combinatorial optimization problems
- graph cuts
- integer program
- feasible solution
- energy function
- optimal solution
- graph partitioning
- image segmentation
- pairwise
- markov random field
- directed graph
- valid inequalities
- global constraints
- graph structure
- computational complexity
- interior point
- objective function
- spanning tree
- genetic algorithm