1. Adam, L., Branda, M.: Nonlinear chance constrained problems: optimality conditions, regularization and solvers. J. Optim. Theory Appl. 170(2), 419–436 (2016)
2. Butkovic, P., MacCaig, M.: A strongly polynomial method for solving integer max-linear optimization problems in a generic case. J. Optim. Theory Appl. 165(3), 941–963 (2015)
3. Ceria, S., Cordier, C., Marchand, H., Wolsey, L.A.: Cutting planes for integer programs with general integer variables. Math. Program. 81, 201–214 (1998)
4. Ciriani, T.A.: The free parametrization for linear programming with bounded variables. Rendiconti del Seminario Matematico della Universitá di Padova. 47, 77–107 (1972)
5. Dahiya, K., Verma,V.: Valid-cuts in integer programming with bounded variables. In: APORS: operational research and its applications: recent trends (Proceedings of sixth international conference APORS-2003 with IFORS, New Delhi, December 8–11, 2003.), vol. 1, pp. 19–28 (2003)