On solving a non-convex quadratic programming problem involving resistance distances in graphs

Quadratic programming problems involving distance matrix ( D ) that arises in trees are considered in the literature by Dankelmann (Discrete Math 312:12–20, 2012 ), Bapat and Neogy (Ann Oper Res 243:365–373, 2016 ). In this paper, we consider the question of solving the quadratic programming problem...

Full description

Saved in:

Bibliographic Details
Published in:	Annals of operations research Vol. 287; no. 2; pp. 643 - 651
Main Authors:	Dubey, Dipti, Neogy, S. K.
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.04.2020 Springer Springer Nature B.V
Subjects:	Analysis Business and Management Combinatorics Distance matrices Graphic methods Graphs Mathematical programming Matrices (mathematics) Methods Operations research Operations Research/Decision Theory Problem solving Quadratic programming S.I.: Game theory and optimization Studies Theory of Computation India Non-convex quadratic programming Laplacian matrix Polynomial time algorithm Symmetric bimatrix game Resistance distance 90C33
ISSN:	0254-5330, 1572-9338
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!