On inequality constraints in well-known optimisation problems: properties and applications

References

• Adams, D. K. (2021). Corn co-product logistics–an application of linear programming [Master Thesis, University of Nebraska].
   Google Scholar
• Agadaga, G. O., & Akpan, N. P. (2017). Transshipment problem and its variants: A review. Mathematical Theory and Modeling, 7(2), 19–32.
   Google Scholar
• Almaatani, D. E. (2014). New computational approaches for the transportation models [PhD thesis]. Laurentian University of Sudbury.
   Google Scholar
• Bazaraa, M. S., Jarvis, J. J., & Sherali, H. D. (2008). Linear programming and network flows. John Wiley & Sons.
   Google Scholar
• Belegundu, A. D., & Chandrupatla, T. R. (2019). Optimization concepts and applications in engineering. Cambridge University Press.
   Google Scholar
• Bertsekas, D. P. (1991). Linear network optimization: Algorithms and codes. MIT Press.
   Google Scholar
• Bookbinder, J. H., & Tan, J. Y. (1988). Strategies for the probabilistic lot-sizing problem with service-level constraints. Management Science, 34(9), 1096–1108. https://doi.org/10.1287/mnsc.34.9.1096
   Web of Science ®Google Scholar
• Brahimi, N., Absi, N., Dauzère-Pérès, S., & Nordli, A. (2017). Single-item dynamic lot-sizing problems: An updated survey. European Journal of Operational Research, 263(3), 838–863. https://doi.org/10.1016/j.ejor.2017.05.008
   Web of Science ®Google Scholar
• Cohen, A. I., & Sherkat, V. R. (1987). Optimization-based methods for operations scheduling. Proceedings of the IEEE, 75(12), 1574–1591. https://doi.org/10.1109/PROC.1987.13928
   Web of Science ®Google Scholar
• Cruz-Mejía, O., & Letchford, A. N. (2023). A survey on exact algorithms for the maximum flow and minimum-cost flow problems. Networks, 82(2), 167–176. https://doi.org/10.1002/net.22169
   Web of Science ®Google Scholar
• Dhouib, S. (2021). A novel heuristic for the transportation problem: Dhouib-Matrix-TP1. International Journal of Recent Engineering Science, 8(4), 1–5. https://doi.org/10.14445/23497157/IJRES-V8I4P101
   Google Scholar
• Díaz-Parra, O., Ruiz-Vanoye, J. A., Bernábe Loranca, B., Fuentes-Penna, A., & Barrera-Cámara, R. A. (2014). A survey of transportation problems. Journal of Applied Mathematics, 2014, Article ID 848129. https://doi.org/10.1155/2014/848129
   Google Scholar
• Farhangi, H. (2021). Multi-echelon supply chains with lead times and uncertain demands. SN Operations Research Forum, 2(3), 1–25. https://doi.org/10.1007/s43069-021-00080-1
   Google Scholar
• Farhangi, H., & Niranjan, S. (2019). Inventory balance formulations, extensions of the deterministic dynamic lot sizing problem. In 2019 Annual Conference of the Decision Sciences Institute Proceedings (pp. 370–387). https://sedsi.decisionsciences.org/past-proceedings/
   Google Scholar
• Faudzi, S., Abdul-Rahman, S., & Abd Rahman, R. (2018). An assignment problem, its application in education domain: A review and potential path. Advances in Operations Research, 2018(45–48), 1–19.Article ID 8958393. https://doi.org/10.1155/2018/8958393
   Google Scholar
• Gaglani, M. S. (2011). A study on transportation problem, transshipment problem, assignment problem and supply chain management [PhD thesis]. Saurashtra University.
   Google Scholar
• Glock, C. H., Grosse, E. H., & Ries, J. M. (2014). The lot sizing problem: A tertiary study. International Journal of Production Economics, 155, 39–51. https://doi.org/10.1016/j.ijpe.2013.12.009
   Web of Science ®Google Scholar
• Goldberg, A. V., & Tarjan, R. E. (2014). Efficient maximum flow algorithms. Communications of the ACM, 57(8), 82–89. https://doi.org/10.1145/2628036
   Web of Science ®Google Scholar
• Jordan, J. D., & Air Force Institute of Technology, Wright-Patterson AFB, OH, Graduate School of Engineering and Management. (2012). The average network flow problem: Shortest path and minimum cost flow formulations, algorithms, heuristics, and complexity.
   Google Scholar
• Kacher, Y., & Singh, P. (2021). A comprehensive literature review on transportation problems. International Journal of Applied and Computational Mathematics, 7(5), 1–49. https://doi.org/10.1007/s40819-021-01134-y
   Google Scholar
• Kennedy, J. O. (1988). Principles of dynamic optimization in resource management. Agricultural Economics, 2(1), 57–72. https://doi.org/10.1111/agec.v2.1
   Google Scholar
• Khurana, A. (2015). Variants of transshipment problem. European Transport Research Review, 7(2), 1–19. https://doi.org/10.1007/s12544-015-0154-8
   Web of Science ®Google Scholar
• Kolasa, T., & Krol, D. (2011). A survey of algorithms for paper-reviewer assignment problem. IETE Technical Review, 28(2), 123–134. https://doi.org/10.4103/0256-4602.78092
   Web of Science ®Google Scholar
• Kupferman, O. (2018). Playing with the maximum-flow problem. In A. G. Barthe, G. Sutcliffe, & M. Veanes (Eds.), LPAR-22. 22nd iInternational conference on logic for programming, artificial intelligence and reasoning (pp. 18–25). EasyChair Publications.
   Google Scholar
• Lakhal, S., Martel, A., Kettani, O., & Oral, M. (2001). On the optimization of supply chain networking decisions. European Journal of Operational Research, 129(2), 259–270. https://doi.org/10.1016/S0377-2217(00)00223-X
   Web of Science ®Google Scholar
• Lee, J., & Beskow, D. (2019). One army school system assignment optimization. https://doi.org/10.13140/RG.2.2.23254.91208
   Google Scholar
• Li, B., Wu, G., He, Y., Fan, M., & Pedrycz, W. (2022). An overview and experimental study of learning-based optimization algorithms for the vehicle routing problem. IEEE/CAA Journal of Automatica Sinica, 9(7), 1115–1138. https://doi.org/10.1109/JAS.2022.105677
   Google Scholar
• Loiola, E. M., De Abreu, N. M. M., Boaventura-Netto, P. O., Hahn, P., & Querido, T. (2007). A survey for the quadratic assignment problem. European Journal of Operational Research, 176(2), 657–690. https://doi.org/10.1016/j.ejor.2005.09.032
   Web of Science ®Google Scholar
• Madkour, A., Aref, W. G., Rehman, F. U., Rahman, M. A., & Basalamah, S. (2017). A survey of shortest-path algorithms. arXiv preprint arXiv:1705.02044.
   Google Scholar
• Matai, R., Singh, S. P., & Mittal, M. L. (2010). Traveling salesman problem: An overview of applications, formulations, and solution approaches. In D. Davendra (Ed.), Traveling salesman problem, theory and applications (pp. 1–25). IntechOpen.
   Google Scholar
• Morsidi, F. (2023). Distribution path segmentation using route relocation and savings heuristics for multi-depot vehicle routing. Malaysian Journal of Science and Advanced Technology, 3(2), 72–80. https://doi.org/10.56532/mjsat.v3i2
   Google Scholar
• Nemirovski, A., Juditsky, A., Lan, G., & Shapiro, A. (2009). Robust stochastic approximation approach to stochastic programming. SIAM Journal on Optimization, 19(4), 1574–1609. https://doi.org/10.1137/070704277
   Web of Science ®Google Scholar
• Ni, Q., & Tang, Y. (2023). A bibliometric visualized analysis and classification of vehicle routing problem research. Sustainability, 15(9), 7394. https://doi.org/10.3390/su150973947394.
   Web of Science ®Google Scholar
• Pillac, V., Gendreau, M., Guéret, C., & Medaglia, A. L. (2013). A review of dynamic vehicle routing problems. European Journal of Operational Research, 225(1), 1–11. https://doi.org/10.1016/j.ejor.2012.08.015
   Web of Science ®Google Scholar
• Pop, P. C., Cosma, O., Sabo, C., & Sitar, C. P. (2023). A comprehensive survey on the generalized traveling salesman problem. European Journal of Operational Research. https://doi.org/10.1016/j.ejor.2023.07.022
   Web of Science ®Google Scholar
• Shi, R., & Niu, L. (2023). A brief survey on learning based methods for vehicle routing problems. Procedia Computer Science, 221, 773–780. https://doi.org/10.1016/j.procs.2023.08.050
   Google Scholar
• Turner, L. (2011). Variants of the shortest path problem. Algorithmic Operations Research, 6(2), 91–104.
   Google Scholar
• Wagner, H. M., & Whitin, T. M. (1958). Dynamic version of the economic lot size model. Management Science, 5(1), 89–96. https://doi.org/10.1287/mnsc.5.1.89
   Web of Science ®Google Scholar
• Yalaoui, A., Chehade, H., Yalaoui, F., & Amodeo, L. (2012). Optimization of logistics. John Wiley & Sons.
   Google Scholar
• Yao, C., Chen, S., Salazar, M., & Yang, Z. (2023). Joint routing and charging problem of electric vehicles with incentive-aware customers considering spatio-temporal charging prices. IEEE Transactions on Intelligent Transportation Systems, 24(11), 12215–12226. https://doi.org/10.1109/TITS.2023.3286952
   Google Scholar
• Zhou, Y., Li, J., Hao, J. K., & Glover, F. (2023a). Detecting critical nodes in sparse graphs via ‘reduce-solve-combine’ memetic search. INFORMS Journal on Computing. https://doi.org/10.1287/ijoc.2022.0130
   Web of Science ®Google Scholar
• Zhou, Y., Wang, G., Hao, J. K., Geng, N., & Jiang, Z. (2023b). A fast tri-individual memetic search approach for the distance-based critical node problem. European Journal of Operational Research, 308(2), 540–554. https://doi.org/10.1016/j.ejor.2022.11.039
   Web of Science ®Google Scholar