On a quadratic programming problem involving distances in trees

DOI10.1007/s10479-014-1743-yzbMath1348.90511OpenAlexW2003528959MaRDI QIDQ338937

S. K. Neogy, Ravindra B. Bapat

Publication date: 7 November 2016

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-014-1743-y

zbMATH Keywords

treepolynomial timequadratic programming problemLemke's algorithmdistance matrixfinite metric spacesymmetric bimatrix game

Mathematics Subject Classification ID

Trees (05C05) Quadratic programming (90C20) Applications of graph theory to circuits and networks (94C15)

Related Items

Variance and Covariance of Distributions on Graphs, On solving a non-convex quadratic programming problem involving resistance distances in graphs

Cites Work

• Identities for minors of the Laplacian, resistance and distance matrices
• Average distance in weighted graphs
• On a conjecture concerning spanning tree invariants and loop systems
• Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm
• A polynomial-time algorithm for a class of linear complementarity problems
• Finite metric spaces of strictly negative type
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• Regularity versus Degeneracy in Dynamics, Games, and Optimization: A Unified Approach to Different Aspects
• Some NP-complete problems in quadratic and nonlinear programming
• Bimatrix Equilibrium Points and Mathematical Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item