Minimum cost subgraph matching using a binary linear program.
Julien LerougeMaroua HammamiPierre HérouxSébastien AdamPublished in: Pattern Recognit. Lett. (2016)
Keyphrases
- graph data
- minimum cost
- subgraph matching
- linear program
- np hard
- linear programming
- linear relaxation
- optimal solution
- approximation algorithms
- network flow
- simplex method
- spanning tree
- primal dual
- integer program
- interior point methods
- linear programming problems
- simplex algorithm
- lower bound
- mixed integer
- column generation
- computational complexity
- dynamic programming
- special case
- integer programming
- objective function
- constraint satisfaction problems
- subgraph isomorphism
- minimum cost flow
- integrality gap
- mathematical programming
- lagrangian relaxation
- knapsack problem
- branch and bound algorithm
- feasible solution
- reinforcement learning