1. A linear time algorithm for computing the Voronoi diagram of a convex polygon;Aggarwal;Discrete Comput. Geom.,1989
2. Rectilinear Steiner trees: efficient special case algorithms;Aho;Networks,1977
3. Set partitioning: a survey;Balas;SIAM Rev.,1976
4. Balas, E., and L. Qi [1990] Linear-time separation algorithms for the three-index assignment polytope, Management Science Research Report 562, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA.
5. Facets of the three-index assignment polytope;Balas;Discrete Appl. Math.,1989