Method for solving a convex integer programming problem.
Convex separable minimization problems with a linear constraint and bounded variables.
An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint.
Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in .
On the Implementation of Stochastic Quasigradient Methods to some Facility Location Problems
Page 1