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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Annals of operations research Ročník 287; číslo 2; s. 643 - 651
Hlavní autoři:	Dubey, Dipti, Neogy, S. K.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.04.2020 Springer Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!