Pages that link to "Item:Q2757541"

The following pages link to A simplicial approach to the determination of an integer point of a simplex (Q2757541):

Displaying 8 items.

• A fixed point iterative approach to integer programming and its distributed computation (Q288180) (← links)
• An arbitrary starting variable dimension algorithm for computing an integer point of a simplex (Q1303784) (← links)
• Piecewise linear methods for nonlinear equations and optimization (Q1593829) (← links)
• On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering (Q1637226) (← links)
• (Q4883682) (← links)
• The Flatness Theorem for Some Class of Polytopes and Searching an Integer Point (Q5265218) (← links)
• Computing an integer point of a class of convex sets. (Q5929418) (← links)
• Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm (Q5936075) (← links)