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

DOI10.1287/MOOR.6.4.579MaRDI QIDQ4739682zbMATH OpenOpenAlexFDO

Authors 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 hullcomplete settransportation polytopecyclic polytopessimplicial 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)

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4739682)