Approximate Labelling for Simplicial Algorithms and Two Classes of Special Subsets of the Sphere

DOI10.1287/MOOR.6.4.579zbMath0503.90082OpenAlexW2017371276MaRDI QIDQ4739682

Michael J. Todd

Publication date: 1981

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

Full work available at URL: https://doi.org/10.1287/moor.6.4.579

zbMATH Keywords

convex hullcyclic polytopescomplete settransportation polytopesimplicial algorithmsinteger labellingapproximating zeroes of functionsspecial subsets of the sphere

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Fixed-point and coincidence theorems (topological aspects) (54H25) Fixed points and coincidences in algebraic topology (55M20)

Related Items (2)

Efficiency and implementation of simplicial zero point algorithms ⋮ Simplicial zero-point algorithms: A unifying description

This page was built for publication: Approximate Labelling for Simplicial Algorithms and Two Classes of Special Subsets of the Sphere