
On Optimal wgons in Convex Polygons
Let P be a set of n points in ℝ^2. For a given positive integer w<n, our...
read it

Counting vertices of integer polytopes defined by facets
We present a number of complexity results concerning the problem of coun...
read it

SOCPbased disjunctive cuts for a class of integer nonlinear bilevel programs
We study a class of bilevel integer programs with secondorder cone cons...
read it

Counting Integral Points in Polytopes via Numerical Analysis of Contour Integration
In this paper, we address the problem of counting integer points in a ra...
read it

On the number of integer points in translated and expanded polyhedra
We prove that the problem of minimizing the number of integer points inp...
read it

A simple and efficient dichotomic search algorithm for multiobjective mixed integer linear programs
We present a simple and at the same time fficient algorithm to compute a...
read it

Deterministic Linear Time Constrained Triangulation using Simplified Earcut
Triangulation algorithms that conform to a set of nonintersecting input...
read it
How to Find the Convex Hull of All Integer Points in a Polyhedron?
We propose a cutbased algorithm for finding all vertices and all facets of the convex hull of all integer points of a polyhedron defined by a system of linear inequalities. Our algorithm DDM Cuts is based on the Gomory cuts and the dynamic version of the double description method. We describe the computer implementation of the algorithm and present the results of computational experiments comparing our algorithm with a naive one.
READ FULL TEXT
Comments
There are no comments yet.