On solving a non-convex quadratic programming problem involving resistance distances in graphs
DOI10.1007/S10479-018-3018-5zbMATH Open1437.90155OpenAlexW2888534485MaRDI QIDQ2177791FDOQ2177791
Authors: Dipti Dubey, S. K. Neogy 
Publication date: 6 May 2020
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-018-3018-5
Recommendations
Laplacian matrixresistance distancepolynomial time algorithmsymmetric bimatrix gamenon-convex quadratic programming
Quadratic programming (90C20) Programming involving graphs or networks (90C35) Nonconvex programming, global optimization (90C26)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Identities for minors of the Laplacian, resistance and distance matrices
- Bimatrix Equilibrium Points and Mathematical Programming
- A polynomial-time algorithm for a class of linear complementarity problems
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- Title not available (Why is that?)
- Two-person nonzero-sum games and quadratic programming
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- A clique algorithm for standard quadratic programming
- Finite metric spaces of strictly negative type
- Regularity versus Degeneracy in Dynamics, Games, and Optimization: A Unified Approach to Different Aspects
- On a quadratic programming problem involving distances in trees
- Average distance in weighted graphs
- Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: On solving a non-convex quadratic programming problem involving resistance distances in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2177791)
