Pages that link to "Item:Q4268868"
From MaRDI portal
The following pages link to Computing Two-Dimensional Integer Hulls (Q4268868):
Displayed 17 items.
- Computing efficiently the lattice width in any dimension (Q638564) (← links)
- The two variable per inequality abstract domain (Q656848) (← links)
- Mapping multiple regions to the grid with bounded Hausdorff distance (Q832913) (← links)
- Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions (Q835601) (← links)
- Approximating a real number by a rational number with a limited denominator: a geometric approach (Q967407) (← links)
- Intersection cuts for single row corner relaxations (Q1621696) (← links)
- Euclidean farthest-point Voronoi diagram of a digital edge (Q2255824) (← links)
- Fast recognition of a digital straight line subsegment: two algorithms of logarithmic time complexity (Q2255825) (← links)
- An algorithm for the separation of two-row cuts (Q2436649) (← links)
- A polynomial algorithm for one problem of guillotine cutting (Q2465953) (← links)
- An asymptotically exact algorithm for the high-multiplicity bin packing problem (Q2570998) (← links)
- Two-halfspace closure (Q2689824) (← links)
- Splitting the Control Flow with Boolean Flags (Q3522080) (← links)
- Efficient Lattice Width Computation in Arbitrary Dimension (Q3648771) (← links)
- Split Cuts in the Plane (Q5147031) (← links)
- Ranking Functions for Linear-Constraint Loops (Q5501930) (← links)
- A note on the computation of the fraction of smallest denominator in between two irreducible fractions (Q5962530) (← links)