On solving a non-convex quadratic programming problem involving resistance distances in graphs.
Dipti DubeyS. K. NeogyPublished in: Ann. Oper. Res. (2020)
Keyphrases
- multicommodity flow problems
- convex optimization problems
- convex programming
- graph partitioning
- graph matching
- computationally efficient
- convex optimization
- combinatorial optimization
- distance function
- graph theory
- weighted graph
- graph mining
- globally optimal
- convex hull
- quadratic programming
- subgraph isomorphism
- series parallel
- linearly constrained
- quadratic optimization problems
- distance measure