On solving a non-convex quadratic programming problem involving resistance distances in graphs
Author
Abstract
Suggested Citation
DOI: 10.1007/s10479-018-3018-5
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- C. E. Lemke, 1965. "Bimatrix Equilibrium Points and Mathematical Programming," Management Science, INFORMS, vol. 11(7), pages 681-689, May.
- Éva Tardos, 1986. "A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs," Operations Research, INFORMS, vol. 34(2), pages 250-256, April.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- R. B. Bapat & S. K. Neogy, 2016. "On a quadratic programming problem involving distances in trees," Annals of Operations Research, Springer, vol. 243(1), pages 365-373, August.
- Zhang, Bin, 2012. "Multi-tier binary solution method for multi-product newsvendor problem with multiple constraints," European Journal of Operational Research, Elsevier, vol. 218(2), pages 426-434.
- Ting Pong & Hao Sun & Ningchuan Wang & Henry Wolkowicz, 2016. "Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem," Computational Optimization and Applications, Springer, vol. 63(2), pages 333-364, March.
- Talman, A.J.J. & van der Heyden, L., 1981.
"Algorithms for the linear complementarity problem which allow an arbitrary starting point,"
Research Memorandum
FEW 99, Tilburg University, School of Economics and Management.
- Talman, A.J.J. & Van der Heyden, L., 1983. "Algorithms for the linear complementarity problem which allow an arbitrary starting point," Other publications TiSEM ececdefe-89ec-4a8a-8a2d-8, Tilburg University, School of Economics and Management.
- Dolf A.J.J. Talman & Ludo Van der Heyden, 1981. "Algorithms for the Linear Complementarity Problem Which Allow an Arbitrary Starting Point," Cowles Foundation Discussion Papers 600, Cowles Foundation for Research in Economics, Yale University.
- Talman, A.J.J. & van der Heyden, L., 1981. "Algorithms for the linear complementarity problem which allow an arbitrary starting point," Other publications TiSEM 2aca8cbf-e8c5-4e8f-b6da-d, Tilburg University, School of Economics and Management.
- Bernhard von Stengel & Antoon van den Elzen & Dolf Talman, 2002.
"Computing Normal Form Perfect Equilibria for Extensive Two-Person Games,"
Econometrica, Econometric Society, vol. 70(2), pages 693-715, March.
- von Stengel, B. & van den Elzen, A.H. & Talman, A.J.J., 1997. "Computing normal form perfect equilibria for extensive two-person games," Other publications TiSEM 4487e2bf-5bc1-47d3-819f-2, Tilburg University, School of Economics and Management.
- von Stengel, B. & van den Elzen, A.H. & Talman, A.J.J., 2002. "Computing normal form perfect equilibria for extensive two-person games," Other publications TiSEM 9f112346-b587-47f3-ad2e-6, Tilburg University, School of Economics and Management.
- von Stengel, B. & van den Elzen, A.H. & Talman, A.J.J., 1997. "Computing normal form perfect equilibria for extensive two-person games," Research Memorandum 752, Tilburg University, School of Economics and Management.
- Amitai Armon & Iftah Gamzu & Danny Segev, 2014. "Mobile facility location: combinatorial filtering via weighted occupancy," Journal of Combinatorial Optimization, Springer, vol. 28(2), pages 358-375, August.
- Richard Asmuth, 1978. "Studying Economic Equilibria on Affine Networks Via Lemke's Algorithm," Discussion Papers 314, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Porter, Ryan & Nudelman, Eugene & Shoham, Yoav, 2008. "Simple search methods for finding a Nash equilibrium," Games and Economic Behavior, Elsevier, vol. 63(2), pages 642-662, July.
- Zhe Liu & Yahya Fathi, 2012. "The nearest point problem in a polyhedral set and its extensions," Computational Optimization and Applications, Springer, vol. 53(1), pages 115-130, September.
- S. R. Mohan, 1997. "Degeneracy Subgraph of the Lemke Complementary Pivot Algorithm and Anticycling Rule," Journal of Optimization Theory and Applications, Springer, vol. 94(2), pages 409-423, August.
- László A. Végh, 2017. "A Strongly Polynomial Algorithm for Generalized Flow Maximization," Mathematics of Operations Research, INFORMS, vol. 42(1), pages 179-211, January.
- Mao-Cheng Cai & Xiaoguang Yang & Yanjun Li, 1999. "Inverse Polymatroidal Flow Problem," Journal of Combinatorial Optimization, Springer, vol. 3(1), pages 115-126, July.
- Bidard, Christian, 2014. "The Ricardian rent theory: an overview," Centro Sraffa Working Papers CSWP8, Centro di Ricerche e Documentazione "Piero Sraffa".
- Ilan Adler & Martin Bullinger & Vijay V. Vazirani, 2024. "A Generalization of von Neumann's Reduction from the Assignment Problem to Zero-Sum Games," Papers 2410.10767, arXiv.org.
- A. T. Phillips & J. B. Rosen, 1990. "Guaranteed ϵ‐approximate solution for indefinite quadratic global minimization," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(4), pages 499-514, August.
- van der Laan, G. & Talman, A.J.J. & Yang, Z.F., 2005.
"Computing Integral Solutions of Complementarity Problems,"
Other publications TiSEM
b8e0c74e-2219-4ab0-99a2-0, Tilburg University, School of Economics and Management.
- van der Laan, G. & Talman, A.J.J. & Yang, Z.F., 2005. "Computing Integral Solutions of Complementarity Problems," Discussion Paper 2005-5, Tilburg University, Center for Economic Research.
- van der Laan, G. & Talman, A.J.J. & Yang, Z.F., 2007. "Computing integral solutions of complementarity problems," Other publications TiSEM 6f3abdc6-b961-4466-8e60-2, Tilburg University, School of Economics and Management.
- Gerard van der Laan & Dolf Talman & Zaifu Yang, 2005. "Computing Integral Solutions of Complementarity Problems," Tinbergen Institute Discussion Papers 05-006/1, Tinbergen Institute.
- Christian Bidard, 2015. "An oddity property for cross-dual games," EconomiX Working Papers 2015-4, University of Paris Nanterre, EconomiX.
- van der Laan, G. & Talman, A.J.J. & Yang, Z.F., 2007. "A vector labeling method for solving discrete zero point and complementarity problems," Other publications TiSEM 070869d0-4e42-4d34-85f9-b, Tilburg University, School of Economics and Management.
- Cai Mao-Cheng, 1999. "Inverse Problems of Matroid Intersection," Journal of Combinatorial Optimization, Springer, vol. 3(4), pages 465-474, December.
- Govindan, Srihari & Wilson, Robert, 2004. "Computing Nash equilibria by iterated polymatrix approximation," Journal of Economic Dynamics and Control, Elsevier, vol. 28(7), pages 1229-1241, April.
More about this item
Keywords
Resistance distance; Laplacian matrix; Non-convex quadratic programming; Polynomial time algorithm; Symmetric bimatrix game;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:287:y:2020:i:2:d:10.1007_s10479-018-3018-5. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.