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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Annals of operations research Jg. 287; H. 2; S. 643 - 651
Hauptverfasser:	Dubey, Dipti, Neogy, S. K.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.04.2020 Springer Springer Nature B.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!