Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm
From MaRDI portal
Publication:5936075
DOI10.1016/S0377-0427(00)00547-1zbMath1041.65049OpenAlexW2083114516MaRDI QIDQ5936075
Hans van Maaren, Chuangyin Dang
Publication date: 2001
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-0427(00)00547-1
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The computation of fixed points and applications
- An arbitrary starting variable dimension algorithm for computing an integer point of a simplex
- Simplizialzerlegungen von beschränkter Flachheit
- A Simplicial Approach to the Determination of an Integer Point of a Simplex
- The D1-Triangulation of Rn for Simplicial Algorithms for Computing Solutions of Nonlinear Equations
- Neighborhood Systems for Production Sets with Indivisibilities
- Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
- A class of simplicial restart fixed point algorithms without an extra dimension
- Production Sets with Indivisibilities, Part I: Generalities
- Production Sets with Indivisibilities, Part II: The Case of Two Activities
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- A new variable dimension algorithm for the fixed point problem
- A restart algorithm for computing fixed points without an extra dimension
- Homotopies for computation of fixed points
- Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods
- The Approximation of Fixed Points of a Continuous Mapping
- SIMPLICIAL APPROXIMATION OF FIXED POINTS
- Homotopies for computation of fixed points on unbounded regions
This page was built for publication: Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm
