Computing an integer point of a class of convex sets.
From MaRDI portal
Recommendations
- A simplicial approach to the determination of an integer point of a simplex
- Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm
- An arbitrary starting homotopy-like simplicial algorithm for computing an integer point in a class of polytopes
- An algorithm for determining the minimal convex subset that contains all the integer points of a convex polyhedral set
- An arbitrary starting variable dimension algorithm for computing an integer point of a simplex
Cites work
- A class of simplicial restart fixed point algorithms without an extra dimension
- A new variable dimension algorithm for the fixed point problem
- A restart algorithm for computing fixed points without an extra dimension
- A simplicial approach to the determination of an integer point of a simplex
- An arbitrary starting variable dimension algorithm for computing an integer point of a simplex
- Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm
- Homotopies for computation of fixed points
- Homotopies for computation of fixed points on unbounded regions
- scientific article; zbMATH DE number 3487169 (Why is no real title available?)
- scientific article; zbMATH DE number 757685 (Why is no real title available?)
- Production Sets with Indivisibilities, Part I: Generalities
- Production Sets with Indivisibilities, Part II: The Case of Two Activities
- Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
- SIMPLICIAL APPROXIMATION OF FIXED POINTS
- Simplizialzerlegungen von beschränkter Flachheit
- The Approximation of Fixed Points of a Continuous Mapping
- The computation of fixed points and applications
- The D1-Triangulation of Rn for Simplicial Algorithms for Computing Solutions of Nonlinear Equations
- Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods
Cited in
(7)- An algorithm for determining the minimal convex subset that contains all the integer points of a convex polyhedral set
- Simplicial pivoting algorithms for a tractable class of integer programs
- A simplicial approach to the determination of an integer point of a simplex
- scientific article; zbMATH DE number 3869065 (Why is no real title available?)
- scientific article; zbMATH DE number 3874995 (Why is no real title available?)
- An arbitrary starting homotopy-like simplicial algorithm for computing an integer point in a class of polytopes
- Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm
This page was built for publication: Computing an integer point of a class of convex sets.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5929418)
