#### Filter Results:

#### Publication Year

2006

2007

#### Publication Type

#### Key Phrase

#### Publication Venue

Learn More

Partitions of a plane, based on two or three of its points, are introduced. The study of these partitions is applied to finding the minimal enclosing circle (MEC) for a set S of n planar points. MEC(S), the MEC of n points of S, is defined by either a pair of S points with the largest distance (tight two-tuple) or by a triplet of S points spread on more… (More)

Integer programming algorithms based on the ordered enumeration method are described. Combining dynamic programming and branch and bound ideas in one efficient computational process, S. S. Lebedev implemented his method for solving integer linear programming problems in 1968. A number of ordered enumeration algorithms were developed since the 1970's. The… (More)

- ‹
- 1
- ›