Pages that link to "Item:Q5929418"
From MaRDI portal
The following pages link to Computing an integer point of a class of convex sets. (Q5929418):
Displaying 4 items.
- An algorithm for determining the minimal convex subset that contains all the integer points of a convex polyhedral set (Q1344644) (← links)
- Simplicial pivoting algorithms for a tractable class of integer programs (Q1598876) (← links)
- A simplicial approach to the determination of an integer point of a simplex (Q2757541) (← links)
- (Q3340526) (← links)