Nicolai N. Pisaruk

Learn More
A well-known result on unions of polyhedra in the same space gives an extended formulation whose projection is the convex hull of the union. Here in contrast we study the unions of polytopes in different spaces, giving a complete description of the convex hull without additional variables. When the underlying polytopes are monotone, the facets are described(More)
We study the problem of scheduling a single machine with the precedence relation on the set of jobs to minimize average weighted completion time. The problem is strongly NP-hard. The 0rst combinatorial 2-approximation algorithm for this scheduling problem was developed by the author in 1992 (in fact, this algorithm solves a more general problem). Here we(More)
  • 1