Computing Two-Dimensional Integer Hulls
From MaRDI portal
Publication:4268868
DOI10.1137/S009753979528977XzbMath1020.52015MaRDI QIDQ4268868
Publication date: 28 October 1999
Published in: SIAM Journal on Computing (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
90C10: Integer programming
11A55: Continued fractions
52C05: Lattices and convex bodies in (2) dimensions (aspects of discrete geometry)
Related Items
Ranking Functions for Linear-Constraint Loops, A note on the computation of the fraction of smallest denominator in between two irreducible fractions, Computing efficiently the lattice width in any dimension, The two variable per inequality abstract domain, Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions, Approximating a real number by a rational number with a limited denominator: a geometric approach, Intersection cuts for single row corner relaxations, Euclidean farthest-point Voronoi diagram of a digital edge, Fast recognition of a digital straight line subsegment: two algorithms of logarithmic time complexity, An algorithm for the separation of two-row cuts, A polynomial algorithm for one problem of guillotine cutting, An asymptotically exact algorithm for the high-multiplicity bin packing problem, Splitting the Control Flow with Boolean Flags, Efficient Lattice Width Computation in Arbitrary Dimension
