PLALGO
From MaRDI portal
Software:19889
swMATH7873MaRDI QIDQ19889FDOQ19889
Author name not available (Why is that?)
Cited In (10)
- Rudiments of an average case complexity theory for piecewise-linear path following algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the computational complexity of piecewise-linear homotopy algorithms
- General equilibrium models and homotopy methods
- An introduction to the octahedral algorithm for the computation of economic equilibria
- Exponential lower bounds for finding Brouwer fixed points
- An efficient simplicial algorithm for computing a zero of a convex union of smooth functions
- Title not available (Why is that?)
- Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's
This page was built for software: PLALGO
