Journal of Pure and Applied Mathematics: Advances and Applications[1] G. R. Bitran and A. C. Hax, Disaggregation and resource allocation
using convex knapsack problems with bounded variables, Management
Science 27(4) (1981), 431-441.
[2] J.-P. Dussault, J. Ferland and B. Lemaire, Convex quadratic
programming with one constraint and bounded variables, Mathematical
Programming 36(1) (1986), 90-104.
[3] R. Helgason, J. Kennington and H. Lall, A polynomially bounded
algorithm for a singly constrained quadratic program, Mathematical
Programming 18(3) (1980), 338-343.
[4] N. Katoh, T. Ibaraki and H. Mine, A polynomial time algorithm for
the resource allocation problem with a convex objective function,
Journal of the Operations Research Society 30(5) (1979), 449-455.
[5] H. Luss and S. K. Gupta, Allocation of effort resources among
competing activities, Operations Research 23(2) (1975), 360-366.
[6] S. M. Stefanov, Valid inequalities and cutting planes for some
polytopes, Mathematical Inequalities and Applications 1(2) (1998),
285-293.
[7] S. M. Stefanov, On the implementation of stochastic quasigradient
methods to some facility location problems, Yugoslav Journal of
Operations Research YUJOR 10(2) (2000), 235-256.
[8] S. M. Stefanov, Convex separable minimization subject to bounded
variables, Computational Optimization and Applications: An
International Journal 18(1) (2001), 27-48.
[9] S. M. Stefanov, Separable Programming: Theory and Methods, Kluwer
Academic Publishers, Dordrecht-Boston-London, 2001.
[10] S. M. Stefanov, A Lagrangian dual method for solving variational
inequalities, Mathematical Inequalities and Applications 5(3) (2002),
597-608.
[11] S. M. Stefanov, Method for solving a convex integer programming
problem, International Journal of Mathematics and Mathematical
Sciences 2003(44) (2003), 2829-2834.
[12] S. M. Stefanov, Convex quadratic minimization subject to a linear
constraint and box constraints, Applied Mathematics Research eXpress
2004 (1) (2004), 17-42.
[13] S. M. Stefanov, Polynomial algorithms for projecting a point onto
a region defined by a linear constraint and box constraints in
Journal of Applied Mathematics 2004(5)
(2004), 409-431.
[14] S. M. Stefanov, An efficient method for minimizing a convex
separable logarithmic function subject to a convex inequality
constraint or linear equality constraint, Journal of Applied
Mathematics and Decision Sciences 2006 (2006), 1-19 (Article ID
89307).
[15] S. M. Stefanov, Minimization of a convex linear-fractional
separable function subject to a convex inequality constraint or
linear equality constraint and bounds on the variables, Applied
Mathematics Research eXpress 2006(4) (2006), 1-24 (Article ID
36581).
[16] S. M. Stefanov, On the solution of variational inequality
problems by cutting plane methods, Mathematical Inequalities and
Applications 10(2) (2007), 427-436.
[17] S. M. Stefanov, Solution of some convex separable resource
allocation and production planning problems with bounds on the
variables, Journal of Interdisciplinary Mathematics 13(5) (2010),
541-569.
[18] S. M. Stefanov, Valid inequalities, cutting planes and
integrality of the knapsack polytope, Journal of Interdisciplinary
Mathematics 14(4) (2011), 389-406.
[19] S. M. Stefanov, About projections in the implementation of
stochastic quasigradient methods to some inventory control problems,
Journal of Pure and Applied Mathematics: Advances and Applications
6(2) (2011), 105-133.
[20] P. H. Zipkin, Simple ranking methods for allocation of one
resource, Management Science 26(1) (1980), 34-43.
