Pages that link to "Item:Q1056676"
From MaRDI portal
The following pages link to The vertices of the knapsack polytope (Q1056676):
Displaying 15 items.
- On the number of irreducible points in polyhedra (Q343724) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- On the polyhedral complexity of the integer points in a hyperball (Q952452) (← links)
- Some theoretical challenges in digital geometry: a perspective (Q967394) (← links)
- On integer points in polyhedra (Q1193530) (← links)
- On integer points in polyhedra: A lower bound (Q1196682) (← links)
- Computing the integer hull of convex polyhedral sets (Q2109987) (← links)
- Convex digital polygons, maximal digital straight segments and convergence of discrete geometric estimators (Q2384109) (← links)
- Computing convex hulls and counting integer points with \texttt{polymake} (Q2398105) (← links)
- Carathéodory bounds for integer cones (Q2480055) (← links)
- Approximation of convex sets by polytopes (Q2519248) (← links)
- About the Structure of the Integer Cone and Its Application to Bin Packing (Q3387933) (← links)
- Upper and lower bound results on the convex hull of integer points in polyhedra (Q4009230) (← links)
- New Algorithmic Results for Bin Packing and Scheduling (Q5283351) (← links)
- On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems (Q6200377) (← links)
