Valid inequalities for the non-unit demand capacitated minimum spanning tree problem with arc time windows and flow costs

References

• Asci, M., Can. Ileri, and O. Dagdeviren. 2019. “Performance Evaluation of Capacitated Minimum Spanning Tree Algorithms for Wireless Sensor Networks.” In 4th International Conference on Computer Science and Engineering (UBMK), 661–665. https://doi.org/10.1109/UBMK.2019.8906993.
   Google Scholar
• Balakrishnan, A., T. L. Magnanti, and R. T. Wong. 1995. “A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning.” Operations Research 43 (1): 58–76. https://doi.org/10.1287/opre.43.1.58.
   Web of Science ®Google Scholar
• Bousda, C., and L. Wolsey. 1991. “Finding Minimum Cost Directed Trees with Demands and Capacities.” Annals of Operations Research 33 (4): 285–303. https://doi.org/10.1007/BF02071977.
   Google Scholar
• Bruglieri, M., S. Mancini, and O. Pisacane. 2019. “More Efficient Formulations and Valid Inequalities for the Green Vehicle Routing Problem.” Transportation Research Part C 105: 283–296. https://doi.org/10.1016/j.trc.2019.05.040.
   Web of Science ®Google Scholar
• Campos, J. C. T., A. X. Martins, and M. J. F. Souza. 2018. “A Hybrid VNS Algorithm for Solving the Multi-Level Capacitated Minimum Spanning Tree Problem.” Electronic Notes in Discrete Mathematics 66: 159–166. https://doi.org/10.1016/j.endm.2018.03.021.
   Google Scholar
• Çetinkaya, C., H. Gökçen, and I. Karaoğlan. 2018. “The Location Routing Problem with arc Time Windows for Terror Regions: A Mixed Integer Formulation.” Journal of Industrial and Production Engineering 35 (5): 309–318. https://doi.org/10.1080/21681015.2018.1479894.
   Web of Science ®Google Scholar
• Çetinkaya, C., I. Karaoglan, and H. Gökçen. 2013. “Two-Stage Vehicle Routing Problem with arc Time Windows: A Mixed Integer Programming Formulation and a Heuristic Approach.” European Journal of Operational Research 230 (3): 539–550. https://doi.org/10.1016/j.ejor.2013.05.001.
   Web of Science ®Google Scholar
• Corberán, Á, R. Eglese, G. Hasle, I. Plana, and J. M. Sanchis. 2020. “Arc Routing Problems: A Review of the Past, Present, and Future.” Networks 77 (1): 88–115. https://doi.org/10.1002/net.21965.
   Web of Science ®Google Scholar
• Corbett, C. J., A. J. Pedraza-Martinez, and L. N. Van Wassenhove. 2022. “Sustainable Humanitarian Operations: An Integrated Perspective.” Production and Operations Management 31 (12): 4393–4406. https://doi.org/10.1111/poms.13848.
   Web of Science ®Google Scholar
• Dolgui, A., and J. M. Proth. 2010. Supply Chain Engineering: Useful Methods and Techniques. Springer.
   Google Scholar
• Gouveia, L., and M. J. Lopes. 2000. “Valid Inequalities for Non-Unit Demand Capacitated Spanning Tree Problems with Flow Costs.” European Journal of Operational Research 121 (2): 394–411. https://doi.org/10.1016/S0377-2217(99)00043-0.
   Web of Science ®Google Scholar
• Govil, M., and J. M. Proth. 2002. Supply Chain Design and Management: Strategic and Tactical Perspectives. Academic Press.
   Google Scholar
• Hamdi, I., and S. Toumi. 2019. “MILP Models and Valid Inequalities for the two-Machine Permutation Flowshop Scheduling Problem with Minimal Time Lags.” Journal of Industrial Engineering International 15 (S1): 223–229. https://doi.org/10.1007/s40092-019-00331-1.
   Google Scholar
• Kritikos, M., and G. Ioannou. 2017. “A Greedy Heuristic for the Capacitated Minimum Spanning Tree Problem.” Journal of the Operational Research Society 68 (10): 1223–1235. https://doi.org/10.1057/s41274-016-0146-7.
   Web of Science ®Google Scholar
• Kritikos, M. N., and G. Ioannou. 2019. “Two Heuristics for the Capacitated Minimum Spanning Tree Problem with Time Windows.” Journal of the Operational Research Society 70 (4): 555–567. https://doi.org/10.1080/01605682.2018.1447255.
   Web of Science ®Google Scholar
• Kritikos, M. N., and G. Ioannou. 2021. “The Capacitated Minimum Spanning Tree Problem with Arc Time Windows.” Expert Systems with Applications 176: 114859. https://doi.org/10.1016/j.eswa.2021.114859.
   Web of Science ®Google Scholar
• Letchford, A. N., and G. Souli. 2020. “Valid Inequalities for Mixed-Integer Programmes with Fixed Charges on Sets of Variables.” Operations Research Letters 48 (3): 240–244. https://doi.org/10.1016/j.orl.2020.03.004.
   Web of Science ®Google Scholar
• Messaoudi, B., A. Oulamara, and S. Salhi. 2023. “A Decomposition Approach for the Periodic Consistent Vehicle Routeing Problem with an Application in the Cleaning Sector.” International Journal of Production Research 61 (22): 7727–7748. https://doi.org/10.1080/00207543.2022.2162145.
   Google Scholar
• Papadimitriou, C. H. 1978. “The Complexity of the Capacitated Tree Problem.” Networks 8 (3): 217–230. https://doi.org/10.1002/net.3230080306.
   Web of Science ®Google Scholar
• Ruiz, E., M. Albareda-Sambola, E. Fernández, and M. G. C. Resende. 2015. “A Biased Random-key Genetic Algorithm for the Capacitated Minimum Spanning Tree Problem.” Computers & Operations Research 57: 95–108. https://doi.org/10.1016/j.cor.2014.11.011.
   Web of Science ®Google Scholar
• Solomon, M. 1986. “The Minimum Spanning Tree Problem with Time Window Constraints.” American Journal of Mathematical and Management Science 6 (3-4): 399–421.
   Google Scholar
• Solomon, M. 1987. “Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints.” Operations Research 35 (2): 254–265. https://doi.org/10.1287/opre.35.2.254.
   Web of Science ®Google Scholar
• Wilhite, A., L. Burns, R. Patnayakuni, and F. Tseng. 2014. “Military Supply Chains and Closed-Loop Systems: Resource Allocation and Incentives in Supply Sourcing and Supply Chain Design.” International Journal of Production Research 52 (7): 1926–1939. https://doi.org/10.1080/00207543.2013.787173.
   Web of Science ®Google Scholar
• Zhang, Y., G. Hua, C. E. Cheng, and J. Zhang. 2020. “Cold Chain Distribution: How to Deal with Node and Arc Time Windows?” Annals of Operations Research 291 (1-2): 1127–1151. https://doi.org/10.1007/s10479-018-3071-0.
   Google Scholar