Firsching, M. (2017). Realizability and inscribability for simplicial polytopes via nonlinear optimization. Mathematical programming, 166(1-2), 273-295. https://doi.org/10.1007/s10107-017-1120-0
Citace podle Chicago (17th ed.)Firsching, Moritz. "Realizability and Inscribability for Simplicial Polytopes via Nonlinear Optimization." Mathematical Programming 166, no. 1-2 (2017): 273-295. https://doi.org/10.1007/s10107-017-1120-0.
Citace podle MLA (9th ed.)Firsching, Moritz. "Realizability and Inscribability for Simplicial Polytopes via Nonlinear Optimization." Mathematical Programming, vol. 166, no. 1-2, 2017, pp. 273-295, https://doi.org/10.1007/s10107-017-1120-0.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..