A branch-and-price algorithm for capacitated hypergraph vertex separation.
Michael BastubbeMarco E. LübbeckePublished in: Math. Program. Comput. (2020)
Keyphrases
- np hard
- learning algorithm
- detection algorithm
- preprocessing
- optimization algorithm
- k means
- optimal solution
- search algorithm
- search space
- significant improvement
- special case
- cost function
- high accuracy
- neural network
- minimal cost
- vertex set
- transportation problem
- undirected graph
- combinatorial auctions
- convergence rate
- ant colony optimization
- hyper graph
- segmentation algorithm
- particle swarm optimization
- higher order
- probabilistic model
- experimental evaluation
- dynamic programming
- pairwise
- objective function
- bayesian networks