[1]

Peter J Billington, John O McClain, and L Joseph Thomas. Mathematical programming approaches to capacity-constrained mrp systems: review, formulation and problem reduction. Management Science, 29(10):1126–1141, 1983.

[2]

Nicos Christofides, Aristide Mingozzi, and Paolo Toth. Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Mathematical programming, 20(1):255–282, 1981.

[3]

Arthur M Geoffrion. Generalized benders decomposition. Journal of optimization theory and applications, 10(4):237–260, 1972.

[4]

R. Li, S. Hu, P. Zhao, Y. Zhou, and M. Yin. A novel local search algorithm for the minimum capacitated dominating set. Journal of the Operational Research Society, 69(8):849–863, 2018.

[5]

A. Potluri and A. Singh. A greedy heuristic and its variants for minimum capacitated dominating set. In M. Parashar, D. Kaushik, O.F. Rana, R. Samtaney, Y. Yang, and Zomaya A., editors, Contemporary Computing, volume 306 of Communications in Computer and Information Science, pages 28–39, Berlin, Heidelberg, 2012. Springer.

[6]

D.M. Ryan and B.A. Foster. An integer programming approach to scheduling. In A. Wren, editor, Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, pages 269–280, Amsterdam, North-Holland, 1981.

[7]

William W Trigeiro, L Joseph Thomas, and John O McClain. Capacitated lot sizing with setup times. Management science, 35(3):353–366, 1989.

GCG