This document has not been cited yet.

1. Çabuk, S.; Erol, R. Solving Dynamic Full-Truckload Vehicle Routing Problem Using an Agent-Based Approach. Mathematics 2024, 12, 2138. [CrossRef]
   Paper not yet in RePEc: Add citation now
   

2. Baldacci, R.; Mingozzi, A.; Roberti, R. New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. 2011, 59, 1269–1283. [CrossRef]

3. Ball, M.O.; Golden, B.; Assad, A.A.; Bodin, L. Planning for truck fleet size in the presence of a common-carrier option. Decis. Sci. 1983, 14, 103–120. [CrossRef]
   Paper not yet in RePEc: Add citation now
   

4. Baller, R.; Fontaine, P.; Minner, S.; Lai, Z. Optimizing automotive inbound logistics: A mixed-integer linear programming approach. Transp. Res. Part E Logist. Transp. Rev. 2022, 163, 102734. [CrossRef]

5. Costa, L.; Contardo, C.; Desaulniers, G. Exact branch-price-and-cut algorithms for vehicle routing. Transp. Sci. 2019, 53, 946–985. [CrossRef]

6. Dantzig, G.B.; Philip, W. Decomposition principle for linear programs. Oper. Res. 1960, 8, 101–111. [CrossRef]

7. de Carvalho, J.M.V. Exact solution of cutting stock problems using column generation and branch-and-bound. Int. Trans. Oper. Res. 1998, 5, 35–44. [CrossRef]
   Paper not yet in RePEc: Add citation now
   

8. Desaulniers, G.; Lessard, F.; Hadjar, A. Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows. Transp. Sci. 2008, 42, 387–404. [CrossRef]

9. Desrosiers, J.; Laporte, G.; Sauve, M.; Soumis, F.; Taillefer, S. Vehicle routing with full loads. Comput. Oper. Res. 1988, 15, 219–226. [CrossRef]
   Paper not yet in RePEc: Add citation now
   
10. Desrosiers, J.; Soumis, F.; Desrochers, M. Routing with time windows by column generation. Networks 1984, 14, 545–565. [CrossRef]
    Paper not yet in RePEc: Add citation now
    
11. Dial, R.; Glover, F.; Karney, D.; Klingman, D. A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees. Networks 1979, 9, 215–248. [CrossRef]
    Paper not yet in RePEc: Add citation now
    
12. Dorigo, M.; Maniezzo, V.; Colorni, A. Ant system: Optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. Part B (Cybern.) 1996, 26, 29–41. [CrossRef] [PubMed]
    Paper not yet in RePEc: Add citation now
    
13. El Bouyahyiouy, K.; Annouch, A.; Bellabdaoui, A. An MILP-based Lexicographic Approach for Robust Selective Full Truckload Vehicle Routing Problem. Int. J. Adv. Comput. Sci. Appl. 2023, 14, 642–650. [CrossRef]
    Paper not yet in RePEc: Add citation now
    
14. El Bouyahyiouy, K.; Bellabdaoui, A. A Genetic-Based Algorithm for Commodity Selection and Full Truckload Vehicle Routing Problem. In International Conference on Digital Technologies and Applications; Springer Nature: Cham, Switzerland, 2023; pp. 806–816.
    Paper not yet in RePEc: Add citation now
    
15. El Bouyahyiouy, K.; Bellabdaoui, A. The selective full truckload multi-depot vehicle routing problem with time windows: Formulation and a genetic algorithm. Int. J. Supply Oper. Manag. 2022, 9, 299–320.
    Paper not yet in RePEc: Add citation now
    
16. Fadda, P.; Mancini, S.; Serra, P.; Fancello, G. The heterogeneous fleet vehicle routing problem with draft limits. Comput. Oper. Res. 2023, 149, 106024. [CrossRef]
    Paper not yet in RePEc: Add citation now
    
17. Feillet, D.; Dejax, P.; Gendreau, M.; Gueguen, C. An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Netw. Int. J. 2004, 44, 216–229. [CrossRef]
    Paper not yet in RePEc: Add citation now
    
18. Floyd, R.W. Algorithm 97: Shortest path. Commun. ACM 1962, 5, 345. [CrossRef] Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
    Paper not yet in RePEc: Add citation now
    
19. Ghilas, V.; Hedtke, I.; Weise, J.; Van Woensel, T. Spot market versus full charter fleet: Decision support for full truck load tenders. EURO J. Decis. Process. 2022, 10, 100022. [CrossRef]
    Paper not yet in RePEc: Add citation now
    

20. Ghorpade, T.; Rangaraj, N. Order first split second heuristic for alternative routing strategy for freight railways. Transp. Policy 2022, 124, 139–148. [CrossRef]

21. Glover, F. Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 1986, 13, 533–549. [CrossRef]
    Paper not yet in RePEc: Add citation now
    

22. Kallehauge, B.; Larsen, J.; Madsen, O.B.; Solomon, M.M. Vehicle Routing Problem with Time Windows; Springer: Greer, SC, USA, 2005. Mathematics 2025, 13, 876 32 of 32

23. Kohl, N.; Desrosiers, J.; Madsen, O.B.; Solomon, M.M.; Soumis, F. 2-path cuts for the vehicle routing problem with time windows. Transp. Sci. 1999, 33, 101–116. [CrossRef]
    Paper not yet in RePEc: Add citation now
    

24. Konstantakopoulos, G.D.; Gayialis, S.P.; Kechagias, E.P. Vehicle routing problem and related algorithms for logistics distribution: A literature review and classification. Oper. Res. 2022, 22, 2033–2062.

25. Lu, F.; Du, Z.; Wang, Z.; Wang, L.; Wang, S. Towards enhancing the crowdsourcing door-to-door delivery: An effective model in Beijing. J. Ind. Manag. Optim. 2025, 21, 2371–2395. [CrossRef]
    Paper not yet in RePEc: Add citation now
    
26. Masmoudi, M.A.; Anna Kuzmicz, K.; Pesch, E.; Demir, E.; Hosny, M. Container truck transportation routing as a mixed fleet heterogeneous dial-a-ride problem. In Proceedings of the 9th International Conference on Engineering, Project, and Production Management (EPPM2018), Cape Town, South Africa, 24–26 November 2018; Volume 312.
    Paper not yet in RePEc: Add citation now
    
27. Melchiori, L.; Nasini, G.; Montagna, J.M.; Corsano, G. Resources synchronization in a full truckload pickup and delivery problem: An exact approach. Comput. Oper. Res. 2023, 151, 106118. [CrossRef]
    Paper not yet in RePEc: Add citation now
    
28. Michelini, S.; Yasemin, A.; Hande, K. Branch-and-price algorithms for a VRP with time windows and variable departure times. In Proceedings of the IFORS 2017-21st Conference of the International Federation of Operational Research Societies, Québec City, QC, Canada, 17–21 July 2017.
    Paper not yet in RePEc: Add citation now
    
29. Nasr, N.; Niaki ST, A.; Hussenzadek Kashan, A.; Seifbarghy, M. An efficient solution method for an agri-fresh food supply chain: Hybridization of Lagrangian relaxation and genetic algorithm. Environ. Sci. Pollut. Res. 2021, 1–19. [CrossRef]
    Paper not yet in RePEc: Add citation now
    
30. Righini, G.; Matteo, S. New dynamic programming algorithms for the resource constrained elementary shortest path problem. Netw. Int. J. 2008, 51, 155–170. [CrossRef]
    Paper not yet in RePEc: Add citation now
    
31. Righini, G.; Salani, M. Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discret. Optim. 2006, 3, 255–273. [CrossRef]
    Paper not yet in RePEc: Add citation now
    
32. Sampson, J.R. Adaptation in natural and artificial systems (John H. Holland). SIAM Rev. 1976, 18, 529. [CrossRef]
    Paper not yet in RePEc: Add citation now
    

33. Savelsbergh, M. A branch-and-price algorithm for the generalized assignment problem. Oper. Res. 1997, 45, 831–841. [CrossRef]

34. Soleilhac, G.; Lehuédé, F.; Medina, J.; Péton, O. The Vehicle Routing Problem with FTL and LTL Carriers. Ph.D. Thesis, IMT Atlantique, Nantes, France, 2022.
    Paper not yet in RePEc: Add citation now
    

35. Solomon, M.M. Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 1987, 35, 254–265. [CrossRef]

36. Xue, N.; Bai, R.; Qu, R.; Aickelin, U. A hybrid pricing and cutting approach for the multi-shift full truckload vehicle routing problem. Eur. J. Oper. Res. 2021, 292, 500–514. [CrossRef]
    Paper not yet in RePEc: Add citation now
    

1. Combined maintenance and routing optimization for large-scale sewage cleaning. (2020). Guaje, Oscar O ; Rodriguez, Juan P ; Fontecha, John E ; Duque, Daniel ; Medaglia, Andres L ; Akhavan-Tabatabaei, Raha.
   In: Annals of Operations Research.
   RePEc:spr:annopr:v:286:y:2020:i:1:d:10.1007_s10479-019-03342-8.

   Full description at Econpapers || Download paper

2. Exact Algorithms for the Multi-Compartment Vehicle Routing Problem with Flexible Compartment Sizes. (2020). Hessler, Katrin.
   In: Working Papers.
   RePEc:jgu:wpaper:2007.

   Full description at Econpapers || Download paper

3. A Branch-Price-and-Cut Algorithm for the Capacitated Multiple Vehicle Traveling Purchaser Problem with Unitary Demand. (2020). Irnich, Stefan ; Bianchessi, Nicola ; Tilk, Christian.
   In: Working Papers.
   RePEc:jgu:wpaper:2003.

   Full description at Econpapers || Download paper

4. The Team Orienteering Problem with Overlaps: An Application in Cash Logistics. (2020). Dullaert, Wout ; Roberti, Roberto ; Bianchessi, Nicola ; Orlis, Christos.
   In: Transportation Science.
   RePEc:inm:ortrsc:v:54:y:2020:i:2:p:470-487.

   Full description at Econpapers || Download paper

5. Optimal Solution of Vehicle Routing Problems with Fractional Objective Function. (2020). Calvo, Roberto Wolfler ; Baldacci, Roberto ; Traversi, Emiliano ; Lim, Andrew.
   In: Transportation Science.
   RePEc:inm:ortrsc:v:54:y:2020:i:2:p:434-452.

   Full description at Econpapers || Download paper

6. A p-step formulation for the capacitated vehicle routing problem. (2020). Spliet, R ; Munari, P ; Dollevoet, T. A. B., .
   In: Econometric Institute Research Papers.
   RePEc:ems:eureir:123411.

   Full description at Econpapers || Download paper

7. Design of diversified package tours for the digital travel industry : A branch-cut-and-price approach. (2020). Zhao, Yanlu ; Alfandari, Laurent.
   In: European Journal of Operational Research.
   RePEc:eee:ejores:v:285:y:2020:i:3:p:825-843.

   Full description at Econpapers || Download paper

8. Exact algorithms to minimize makespan on single and parallel batch processing machines. (2020). Muter, Brahim.
   In: European Journal of Operational Research.
   RePEc:eee:ejores:v:285:y:2020:i:2:p:470-483.

   Full description at Econpapers || Download paper

9. Industrial and tramp ship routing problems: Closing the gap for real-scale instances. (2020). Vidal, Thibaut ; Martinelli, Rafael ; Fagerholt, Kjetil ; Homsi, Gabriel.
   In: European Journal of Operational Research.
   RePEc:eee:ejores:v:283:y:2020:i:3:p:972-990.

   Full description at Econpapers || Download paper

10. Exact methods for mono-objective and Bi-Objective Multi-Vehicle Covering Tour Problems. (2020). Ngueveu, Sandra Ulrich ; Roberti, Roberto ; Jozefowiez, Nicolas ; Glize, Estele.
    In: European Journal of Operational Research.
    RePEc:eee:ejores:v:283:y:2020:i:3:p:812-824.

    Full description at Econpapers || Download paper

11. Bidirectional labeling for solving vehicle routing and truck driver scheduling problems. (2020). Tilk, Christian ; Goel, Asvin.
    In: European Journal of Operational Research.
    RePEc:eee:ejores:v:283:y:2020:i:1:p:108-124.

    Full description at Econpapers || Download paper

12. An exact branch‐and‐price algorithm for multitasking scheduling on unrelated parallel machines. (2019). Zhou, Peng ; Xiong, Xiaoyun ; T. C. E. Cheng, ; Li, Dengfeng ; Yin, Yunqiang.
    In: Naval Research Logistics (NRL).
    RePEc:wly:navres:v:66:y:2019:i:6:p:502-516.

    Full description at Econpapers || Download paper

13. A branch-and-price algorithm for the home-caregiver scheduling and routing problem with stochastic travel and service times. (2019). Jiang, Zhibin ; Liu, Ran ; Yuan, Biao.
    In: Flexible Services and Manufacturing Journal.
    RePEc:spr:flsman:v:31:y:2019:i:4:d:10.1007_s10696-018-9328-8.

    Full description at Econpapers || Download paper

14. Bidirectional labeling for solving vehicle routing and truck driver scheduling problems. (2019). Tilk, Christian ; Goel, Asvin.
    In: Working Papers.
    RePEc:jgu:wpaper:1914.

    Full description at Econpapers || Download paper

15. The Joint Network Vehicle Routing Game. (2019). van den Heuvel, Wilco ; Spliet, R ; van Zon, M.
    In: Econometric Institute Research Papers.
    RePEc:ems:eureir:115273.

    Full description at Econpapers || Download paper

16. A Branch-and-Cut-and-Price algorithm for the Multi-trip Separate Pickup and Delivery Problem with Time Windows at Customers and Facilities. (2019). Cacchiani, Valentina ; Crainic, Teodor Gabriel ; Vigo, Daniele ; Bettinelli, Andrea.
    In: European Journal of Operational Research.
    RePEc:eee:ejores:v:279:y:2019:i:3:p:824-839.

    Full description at Econpapers || Download paper

17. Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem. (2019). Gschwind, Timo ; Irnich, Stefan ; Bianchessi, Nicola.
    In: European Journal of Operational Research.
    RePEc:eee:ejores:v:278:y:2019:i:1:p:91-104.

    Full description at Econpapers || Download paper

18. Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies. (2019). Irnich, Stefan ; Drexl, Michael ; Tilk, Christian.
    In: European Journal of Operational Research.
    RePEc:eee:ejores:v:276:y:2019:i:2:p:549-565.

    Full description at Econpapers || Download paper

19. A branch-and-price algorithm for a vehicle routing with demand allocation problem. (2019). Reihaneh, Mohammad ; Ghoniem, Ahmed.
    In: European Journal of Operational Research.
    RePEc:eee:ejores:v:272:y:2019:i:2:p:523-538.

    Full description at Econpapers || Download paper

20. Requirements from vehicle routing software: perspectives from literature, developers and the freight industry. (2018). Cherrett, Tom J ; Rincon-Garcia, Nicolas ; Waterson, Ben J.
    In: Transport Reviews.
    RePEc:taf:transr:v:38:y:2018:i:1:p:117-138.

    Full description at Econpapers || Download paper

21. A hybrid algorithm for the vehicle routing problem with backhauls, time windows and three-dimensional loading constraints. (2018). Koch, Henriette ; Wascher, Gerhard ; Bortfeldt, Andreas.
    In: OR Spectrum: Quantitative Approaches in Management.
    RePEc:spr:orspec:v:40:y:2018:i:4:d:10.1007_s00291-018-0506-6.

    Full description at Econpapers || Download paper

22. The vehicle routing problem with hard time windows and stochastic service times. (2018). Rei, W ; Gendreau, M ; L.-M. Rousseau, ; Desaulniers, G ; Errico, F.
    In: EURO Journal on Transportation and Logistics.
    RePEc:spr:eurjtl:v:7:y:2018:i:3:d:10.1007_s13676-016-0101-4.

    Full description at Econpapers || Download paper

23. Stabilized Branch-Price-and-Cut for the Commodity-constrained Split Delivery Vehicle Routing Problem. (2018). Gschwind, Timo ; Irnich, Stefan ; Bianchessi, Nicola.
    In: Working Papers.
    RePEc:jgu:wpaper:1817.

    Full description at Econpapers || Download paper

24. Branch-Cut-and-Price for the Scheduling Deliveries with Time Windows in a Direct Shipping Network. (2018). Gschwind, Timo ; Irnich, Stefan ; Emde, Simon ; Tilk, Christian.
    In: Working Papers.
    RePEc:jgu:wpaper:1805.

    Full description at Econpapers || Download paper

25. Branch-Cut-and-Price for the Vehicle Routing Problem with Time Windows and Convex Node Costs. (2018). Song, Yongjia ; Irnich, Stefan ; He, Qie.
    In: Working Papers.
    RePEc:jgu:wpaper:1804.

    Full description at Econpapers || Download paper

26. Nested Branch-and-Price-and-Cut for Vehicle Routing Problems with Multiple Resource Interdependencies. (2018). Irnich, Stefan ; Drexl, Michael ; Tilk, Christian.
    In: Working Papers.
    RePEc:jgu:wpaper:1801.

    Full description at Econpapers || Download paper

27. A scenario decomposition algorithm for strategic time window assignment vehicle routing problems. (2018). Gounaris, Chrysanthos E ; Subramanyam, Anirudh ; Wang, Akang.
    In: Transportation Research Part B: Methodological.
    RePEc:eee:transb:v:117:y:2018:i:pa:p:296-317.

    Full description at Econpapers || Download paper

28. Enhanced Branch-Cut-and-Price algorithm for heterogeneous fleet vehicle routing problems. (2018). Sadykov, Ruslan ; Uchoa, Eduardo ; Pessoa, Artur.
    In: European Journal of Operational Research.
    RePEc:eee:ejores:v:270:y:2018:i:2:p:530-543.

    Full description at Econpapers || Download paper

29. Branch-price-and-cut for the Mixed Capacitated General Routing Problem with Time Windows. (2018). Vocaturo, Francesca ; Lagana, Demetrio ; Ciancio, Claudio.
    In: European Journal of Operational Research.
    RePEc:eee:ejores:v:267:y:2018:i:1:p:187-199.

    Full description at Econpapers || Download paper

30. The vehicle routing problem with service level constraints. (2018). Vidal, Thibaut ; Bulhes, Teobaldo ; Martinelli, Rafael ; Ha, Minh Hoang.
    In: European Journal of Operational Research.
    RePEc:eee:ejores:v:265:y:2018:i:2:p:544-558.

    Full description at Econpapers || Download paper

31. Branch-and-Price-and-Cut for the Periodic Vehicle Routing Problem with Flexible Schedule Structures. (2017). Rothenbacher, Ann-Kathrin.
    In: Working Papers.
    RePEc:jgu:wpaper:1714.

    Full description at Econpapers || Download paper

32. Using Customer-related Data to Enhance E-grocery Home Delivery. (2017). Qiao, Bin ; Han, Yufei ; Giannikas, Vaggelis ; Pan, Shenle ; Grover-Silva, Etta.
    In: Post-Print.
    RePEc:hal:journl:hal-01482901.

    Full description at Econpapers || Download paper

33. Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms. (2017). Baldacci, Roberto ; Hoshino, Edna A ; Lim, Andrew ; Hill, Alessandro.
    In: European Journal of Operational Research.
    RePEc:eee:ejores:v:262:y:2017:i:3:p:879-893.

    Full description at Econpapers || Download paper

34. Asymmetry matters: Dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster. (2017). Gschwind, Timo ; Irnich, Stefan ; Tilk, Christian ; Rothenbacher, Ann-Kathrin.
    In: European Journal of Operational Research.
    RePEc:eee:ejores:v:261:y:2017:i:2:p:530-539.

    Full description at Econpapers || Download paper

35. Biomedical sample transportation in the province of Quebec: a case study. (2016). Chabot, Thomas ; Renaud, Jacques ; Ruiz, Angel ; Anaya-Arenas, Ana Maria .
    In: International Journal of Production Research.
    RePEc:taf:tprsxx:v:54:y:2016:i:2:p:602-615.

    Full description at Econpapers || Download paper

36. A Branch-Price-and-Cut Algorithm for the Inventory-Routing Problem. (2016). Coelho, Leandro C ; Rakke, Jorgen G ; Desaulniers, Guy.
    In: Transportation Science.
    RePEc:inm:ortrsc:v:50:y:2016:i:3:p:1060-1076.

    Full description at Econpapers || Download paper

37. The Edge Set Cost of the Vehicle Routing Problem with Time Windows. (2016). Jepsen, Mads Kehlet ; Reinhardt, Line Blander ; Pisinger, David.
    In: Transportation Science.
    RePEc:inm:ortrsc:v:50:y:2016:i:2:p:694-707.

    Full description at Econpapers || Download paper

38. A Branch-Cut-and-Price Algorithm for the Energy Minimization Vehicle Routing Problem. (2016). Song, Yongjia ; Fukasawa, Ricardo ; He, Qie.
    In: Transportation Science.
    RePEc:inm:ortrsc:v:50:y:2016:i:1:p:23-34.

    Full description at Econpapers || Download paper

39. Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows. (2016). Irnich, Stefan ; Schneider, Michael ; Desaulniers, Guy ; Errico, Fausto.
    In: Operations Research.
    RePEc:inm:oropre:v:64:y:2016:i:6:p:1388-1405.

    Full description at Econpapers || Download paper

40. The Time Window Assignment Vehicle Routing Problem. (2015). Spliet, Remy ; Gabor, Adriana F.
    In: Transportation Science.
    RePEc:inm:ortrsc:v:49:y:2015:i:4:p:721-731.

    Full description at Econpapers || Download paper

41. Effective Handling of Dynamic Time Windows and Its Application to Solving the Dial-a-Ride Problem. (2015). Gschwind, Timo ; Irnich, Stefan.
    In: Transportation Science.
    RePEc:inm:ortrsc:v:49:y:2015:i:2:p:335-354.

    Full description at Econpapers || Download paper

42. Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure. (2015). Martinelli, Rafael ; Contardo, Claudio.
    In: INFORMS Journal on Computing.
    RePEc:inm:orijoc:v:27:y:2015:i:4:p:658-676.

    Full description at Econpapers || Download paper

43. Dynamic ng-Path Relaxation for the Delivery Man Problem. (2014). Roberti, Roberto ; Mingozzi, Aristide.
    In: Transportation Science.
    RePEc:inm:ortrsc:v:48:y:2014:i:3:p:413-424.

    Full description at Econpapers || Download paper

44. Hours of Service Regulations in Road Freight Transport: An Optimization-Based International Assessment. (2014). Vidal, Thibaut ; Goel, Asvin.
    In: Transportation Science.
    RePEc:inm:ortrsc:v:48:y:2014:i:3:p:391-412.

    Full description at Econpapers || Download paper

45. Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows. (2013). van Woensel, Tom ; de Kok, Ton ; Ropke, Stefan ; Dabia, Said.
    In: Transportation Science.
    RePEc:inm:ortrsc:v:47:y:2013:i:3:p:380-396.

    Full description at Econpapers || Download paper

46. A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem. (2013). Ropke, Stefan ; Spoorendonk, Simon ; Jepsen, Mads .
    In: Transportation Science.
    RePEc:inm:ortrsc:v:47:y:2013:i:1:p:23-37.

    Full description at Econpapers || Download paper

47. An Exact Algorithm for the Multitrip Vehicle Routing Problem. (2013). Roberti, Roberto ; Toth, Paolo ; Mingozzi, Aristide.
    In: INFORMS Journal on Computing.
    RePEc:inm:orijoc:v:25:y:2013:i:2:p:193-207.

    Full description at Econpapers || Download paper

48. In-Depth Analysis of Pricing Problem Relaxations for the Capacitated Arc-Routing Problem. (2012). Irnich, Stefan ; Bode, Claudia.
    In: Working Papers.
    RePEc:jgu:wpaper:1212.

    Full description at Econpapers || Download paper

49. Effective Handling of Dynamic Time Windows and Synchronization with Precedences for Exact Vehicle Routing. (2012). Gschwind, Timo ; Irnich, Stefan.
    In: Working Papers.
    RePEc:jgu:wpaper:1211.

    Full description at Econpapers || Download paper

50. New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows. (2012). Roberti, Roberto ; Baldacci, Roberto ; Mingozzi, Aristide.
    In: INFORMS Journal on Computing.
    RePEc:inm:orijoc:v:24:y:2012:i:3:p:356-371.

    Full description at Econpapers || Download paper

Report date: 2025-10-06 02:40:52 || Missing content? Let us know