1. Optimizing omnichannel retailer inventory replenishment using vehicle capacity-sharing with demand uncertainties and service level requirements. (2025). Xu, Henry ; Fan, Zhi-Ping ; Sun, Minghe ; Yuan, Mingli ; Qiu, Ruozhen.
   In: European Journal of Operational Research.
   RePEc:eee:ejores:v:320:y:2025:i:2:p:417-432.

   Full description at Econpapers || Download paper

1. Adelman, D. A price-directed approach to stochastic inventory/routing. 2004 Oper. Res.. 52 499-514

2. Adulyasak, Y. ; Cordeau, J.-F. ; Jans, R. Benders decomposition for production routing under demand uncertainty. 2015 Oper. Res.. 63 851-867

3. Adulyasak, Y. ; Cordeau, J.-F. ; Jans, R. Formulations and branch-and-cut algorithms for multivehicle production and inventory routing problems. 2014 INFORMS J. Comput.. 26 103-120

4. Agra, A. ; Christiansen, M. ; Delgado, A. ; Simonetti, L. Hybrid heuristics for a short sea inventory routing problem. 2014 European J. Oper. Res.. 236 924-935

5. Alvarez, A. ; Cordeau, J.-F. ; Jans, R. ; Munari, P. ; Morabito, R. Inventory routing under stochastic supply and demand. 2021 Omega. 102 -

6. Alvarez, A. ; Munari, P. ; Morabito, R. Iterated local search and simulated annealing algorithms for the inventory routing problem. 2018 Int. Trans. Oper. Res.. 25 1785-1809
   Paper not yet in RePEc: Add citation now
   

7. Archetti, C. ; Bertazzi, L. ; Laporte, G. ; Speranza, M.G. A branch-and-cut algorithm for a vendor-managed inventory-routing problem. 2007 Transp. Sci.. 41 382-391

8. Archetti, C. ; Boland, N. ; Grazia Speranza, M. A matheuristic for the multivehicle inventory routing problem. 2017 INFORMS J. Comput.. 29 377-387

9. Archetti, C. ; Coelho, L.C. ; Speranza, M.G. An exact algorithm for the inventory routing problem with logistic ratio. 2019 Transp. Res. Part E: Logist. Transp. Rev.. 131 96-107

10. Archetti, C. ; Desaulniers, G. ; Speranza, M.G. Minimizing the logistic ratio in the inventory routing problem. 2017 EURO J. Transp. Logist.. 6 289-306

11. Archetti, C. ; Guastaroba, G. ; Huerta-Muñoz, D.L. ; Speranza, M.G. A kernel search heuristic for the multivehicle inventory routing problem. 2021 Int. Trans. Oper. Res.. 28 2984-3013
    Paper not yet in RePEc: Add citation now
    

12. Archetti, C. ; Ljubić, I. Comparison of formulations for the inventory routing problem. 2022 European J. Oper. Res.. -

13. Beardwood, J. ; Halton, J.H. ; Hammersley, J.M. The shortest path through many points. 1959 En : . Cambridge University Press:
    Paper not yet in RePEc: Add citation now
    

14. Bell, W.J. ; Dalberto, L.M. ; Fisher, M.L. ; Greenfield, A.J. ; Jaikumar, R. ; Kedia, P. ; Mack, R.G. ; Prutzman, P.J. Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer. 1983 Interfaces. 13 4-23

15. Beltrami, E.J. ; Bodin, L.D. Networks and vehicle routing for municipal waste collection. 1974 Networks. 4 65-94
    Paper not yet in RePEc: Add citation now
    
16. Bertazzi, L. ; Speranza, M.G. Inventory routing problems: An introduction. 2012 EURO J. Transp. Logist.. 1 307-326
    Paper not yet in RePEc: Add citation now
    
17. Brinkmann, J. ; Ulmer, M.W. ; Mattfeld, D.C. Dynamic lookahead policies for stochastic-dynamic inventory routing in bike sharing systems. 2019 Comput. Oper. Res.. 106 260-279
    Paper not yet in RePEc: Add citation now
    
18. Campbell, A.M. ; Wilson, J.H. Forty years of periodic vehicle routing. 2014 Networks. 63 2-15
    Paper not yet in RePEc: Add citation now
    

19. Christensen, J. ; Erera, A. ; Pacino, D. A rolling horizon heuristic for the stochastic cargo mix problem. 2019 Transp. Res. Part E: Logist. Transp. Rev.. 123 200-220

20. Coelho, L.C. ; Cordeau, J.-F. ; Laporte, G. Heuristics for dynamic and stochastic inventory-routing. 2014 Comput. Oper. Res.. 52 55-67
    Paper not yet in RePEc: Add citation now
    

21. Coelho, L.C. ; Cordeau, J.-F. ; Laporte, G. Thirty years of inventory routing. 2014 Transp. Sci.. 48 1-19

22. Coelho, L.C. ; Laporte, G. A branch-and-cut algorithm for the multi-product multi-vehicle inventory-routing problem. 2013 Int. J. Prod. Res.. 51 7156-7169
    Paper not yet in RePEc: Add citation now
    
23. Coelho, L.C. ; Laporte, G. The exact solution of several classes of inventory-routing problems. 2013 Comput. Oper. Res.. 40 558-565
    Paper not yet in RePEc: Add citation now
    
24. Friske, M.W. ; Buriol, L.S. ; Camponogara, E. A relax-and-fix and fix-and-optimize algorithm for a maritime inventory routing problem. 2022 Comput. Oper. Res.. 137 -
    Paper not yet in RePEc: Add citation now
    
25. Goel, V. ; Furman, K.C. ; Song, J.-H. ; El-Bakry, A.S. Large neighborhood search for LNG inventory routing. 2012 J. Heuristics. 18 821-848
    Paper not yet in RePEc: Add citation now
    

26. Jaillet, P. ; Bard, J.F. ; Huang, L. ; Dror, M. Delivery cost approximations for inventory routing problems in a rolling horizon framework. 2002 Transp. Sci.. 36 292-300

27. Kazemi, S.M. ; Rabbani, M. ; Tavakkoli-Moghaddam, R. ; Shahreza, F.A. Blood inventory-routing problem under uncertainty. 2017 J. Intell. Fuzzy Systems. 32 467-481
    Paper not yet in RePEc: Add citation now
    

28. Kleywegt, A.J. ; Nori, V.S. ; Savelsbergh, M.W. Dynamic programming approximations for a stochastic inventory routing problem. 2004 Transp. Sci.. 38 42-70

29. Kleywegt, A.J. ; Nori, V.S. ; Savelsbergh, M.W. The stochastic inventory routing problem with direct deliveries. 2002 Transp. Sci.. 36 94-118

30. Larraín, H. ; Coelho, L.C. ; Cataldo, A. A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated teller machines. 2017 Comput. Oper. Res.. 85 22-31
    Paper not yet in RePEc: Add citation now
    

31. Liu, W. ; Ke, G.Y. ; Chen, J. ; Zhang, L. Scheduling the distribution of blood products: A vendor-managed inventory routing approach. 2020 Transp. Res. Part E: Logist. Transp. Rev.. 140 -

32. Martinelly, C.D. ; Meskens, N. ; Riane, F. ; Hssini, I. Inventory routing problem with transshipment and substitution for blood products using the case of the belgian blood distribution. 2021 En : IFIP International Conference on Advances in Production Management Systems. Springer:
    Paper not yet in RePEc: Add citation now
    

33. Neves-Moreira, F. ; Almada-Lobo, B. ; Guimarães, L. ; Amorim, P. The multi-product inventory-routing problem with pickups and deliveries: Mitigating fluctuating demand via rolling horizon heuristics. 2022 Transp. Res. Part E: Logist. Transp. Rev.. 164 -

34. Öncan, T. ; Altınel, I.K. ; Laporte, G. A comparative analysis of several asymmetric traveling salesman problem formulations. 2009 Comput. Oper. Res.. 36 637-654
    Paper not yet in RePEc: Add citation now
    

35. Papageorgiou, D.J. ; Cheon, M.-S. ; Nemhauser, G. ; Sokol, J. Approximate dynamic programming for a class of long-horizon maritime inventory routing problems. 2015 Transp. Sci.. 49 870-885

36. Powell, W.B. . 2007 John Wiley & Sons:
    Paper not yet in RePEc: Add citation now
    
37. Rakke, J.G. ; Stålhane, M. ; Moe, C.R. ; Christiansen, M. ; Andersson, H. ; Fagerholt, K. ; Norstad, I. A rolling horizon heuristic for creating a liquefied natural gas annual delivery program. 2011 Transp. Res. C. 19 896-911
    Paper not yet in RePEc: Add citation now
    
38. Smith, M.E. Design of small-sample home-interview travel surveys. 1979 Transp. Res. Rec.. 701 29-35
    Paper not yet in RePEc: Add citation now
    
39. Son, T.A. ; Thao, N.C. Solving inventory routing problem with logistic ratio via dc programming. 2020 En : 2020 12th International Conference on Knowledge and Systems Engineering. IEEE:
    Paper not yet in RePEc: Add citation now
    
40. Stålhane, M. ; Rakke, J.G. ; Moe, C.R. ; Andersson, H. ; Christiansen, M. ; Fagerholt, K. A construction and improvement heuristic for a liquefied natural gas inventory routing problem. 2012 Comput. Ind. Eng.. 62 245-255
    Paper not yet in RePEc: Add citation now
    

41. Tang, Z. ; Jiao, Y. ; Ravi, R. Combinatorial heuristics for inventory routing problems. 2022 INFORMS J. Comput.. 34 370-384

42. Toriello, A. ; Nemhauser, G. ; Savelsbergh, M. Decomposing inventory routing problems with approximate value functions. 2010 Nav. Res. Logist.. 57 718-727

43. Van Anholt, R.G. ; Coelho, L.C. ; Laporte, G. ; Vis, I.F. An inventory-routing problem with pickups and deliveries arising in the replenishment of automated teller machines. 2016 Transp. Sci.. 50 1077-1091

44. Wong, R.T. Integer programming formulations of the traveling salesman problem. 1980 En : Proceedings of the IEEE International Conference of Circuits and Computers. IEEE Press Piscataway NJ:
    Paper not yet in RePEc: Add citation now
    

1. Dynamic migratory beekeeping route recommendation based on spatio-temporal distribution of nectar sources. (2024). Yang, Fei ; Ma, Minghong.
   In: Annals of Operations Research.
   RePEc:spr:annopr:v:341:y:2024:i:2:d:10.1007_s10479-024-06061-x.

   Full description at Econpapers || Download paper

2. An Approximate Dynamic Programming Approach to Dynamic Stochastic Matching. (2024). Vossen, Thomas ; You, Fan.
   In: INFORMS Journal on Computing.
   RePEc:inm:orijoc:v:36:y:2024:i:4:p:1006-1022.

   Full description at Econpapers || Download paper

3. Approximated Dynamic Programming for Production and Inventory Planning Problem in Cold Rolling Process of Steel Production. (2024). Su, Lijie ; Wu, Jing ; Yang, Yang ; Wang, Gongshu.
   In: Mathematics.
   RePEc:gam:jmathe:v:12:y:2024:i:24:p:3922-:d:1542766.

   Full description at Econpapers || Download paper

4. Optimizing the long-term costs of an Inventory Routing Problem using linear relaxation. (2024). Larrain, Homero ; Angulo, Gustavo ; Chiu, Agustin.
   In: Transportation Research Part E: Logistics and Transportation Review.
   RePEc:eee:transe:v:183:y:2024:i:c:s1366554524000371.

   Full description at Econpapers || Download paper

5. Reductions of non-separable approximate linear programs for network revenue management. (2023). Laumer, Simon ; Barz, Christiane.
   In: European Journal of Operational Research.
   RePEc:eee:ejores:v:309:y:2023:i:1:p:252-270.

   Full description at Econpapers || Download paper

6. Stochastic inventory routing with time-based shipment consolidation. (2023). Kiesmuller, Gudrun P ; Sonntag, Danja R ; Schrotenboer, Albert H.
   In: European Journal of Operational Research.
   RePEc:eee:ejores:v:306:y:2023:i:3:p:1186-1201.

   Full description at Econpapers || Download paper

7. Analysis of effective sets of routes for the split-delivery periodic inventory routing problem. (2022). Paradiso, Rosario ; Bertazzi, Luca ; Chua, Geoffrey A ; Lagana, Demetrio.
   In: European Journal of Operational Research.
   RePEc:eee:ejores:v:298:y:2022:i:2:p:463-477.

   Full description at Econpapers || Download paper

8. Dynamic multistage scheduling for patient-centered care plans. (2021). Diamant, Adam.
   In: Health Care Management Science.
   RePEc:kap:hcarem:v:24:y:2021:i:4:d:10.1007_s10729-021-09566-0.

   Full description at Econpapers || Download paper

9. Identifying proactive ICU patient admission, transfer and diversion policies in a public-private hospital network. (2021). Ferrer, Juan-Carlos ; Marquinez, Jose Tomas ; Saure, Antoine ; Cataldo, Alejandro.
   In: European Journal of Operational Research.
   RePEc:eee:ejores:v:295:y:2021:i:1:p:306-320.

   Full description at Econpapers || Download paper

10. Inventory routing for defense: Moving supplies in adversarial and partially observable environments. (2020). Miller, Tim ; Shekh, Slava ; Blom, Michelle ; Gossink, Don ; Pearce, Adrian R.
    In: The Journal of Defense Modeling and Simulation.
    RePEc:sae:joudef:v:17:y:2020:i:1:p:55-81.

    Full description at Econpapers || Download paper

11. Network-Based Approximate Linear Programming for Discrete Optimization. (2020). Nadarajah, Selvaprabu ; Cire, Andre A.
    In: Operations Research.
    RePEc:inm:oropre:v:68:y:2020:i:6:p:1767-1786.

    Full description at Econpapers || Download paper

12. Revisiting Approximate Linear Programming: Constraint-Violation Learning with Applications to Inventory Control and Energy Storage. (2020). Nadarajah, Selvaprabu ; Lin, Qihang ; Soheili, Negar.
    In: Management Science.
    RePEc:inm:ormnsc:v:66:y:2020:i:4:p:1544-1562.

    Full description at Econpapers || Download paper

13. A State Aggregation Approach for Stochastic Multiperiod Last-Mile Ride-Sharing Problems. (2019). Cheng, Shih-Fen ; Agussurja, Lucas ; Lau, Hoong Chuin.
    In: Service Science.
    RePEc:inm:orserv:v:53:y:2019:i:1:p:148-166.

    Full description at Econpapers || Download paper

14. Primal–Dual Algorithms for Order Fulfillment at Urban Outfitters, Inc.. (2019). Farias, Vivek F ; Andrews, John M ; Yan, Chad M ; Khojandi, Aryan I.
    In: Interfaces.
    RePEc:inm:orinte:v:49:y:2019:i:5:p:355-370.

    Full description at Econpapers || Download paper

15. Heuristic algorithm based on reduce and optimize approach for a selective and periodic inventory routing problem in a waste vegetable oil collection environment. (2019). Cárdenas-Barrón, Leopoldo Eduardo ; Cardenas-Barron, Leopoldo Eduardo ; Gonzalez-Velarde, Jose Luis ; Trevio-Garza, Gerardo ; Garza-Nuez, Dagoberto.
    In: International Journal of Production Economics.
    RePEc:eee:proeco:v:211:y:2019:i:c:p:44-59.

    Full description at Econpapers || Download paper

16. The Dynamic Bowser Routing Problem. (2019). Embley, Tim ; Rossi, Roberto ; Tomasella, Maurizio ; Langston, Matthew ; Walsh, Christopher ; Martin-Barragan, Belen.
    In: European Journal of Operational Research.
    RePEc:eee:ejores:v:275:y:2019:i:1:p:108-126.

    Full description at Econpapers || Download paper

17. Stochastic Inventory Routing for Perishable Products. (2018). Crama, Yves ; van Woensel, Tom ; Savelsbergh, Martin ; Rezaei, Mahmood.
    In: Transportation Science.
    RePEc:inm:ortrsc:v:52:y:2018:i:3:p:526-546.

    Full description at Econpapers || Download paper

18. The One-Dimensional Dynamic Dispatch Waves Problem. (2018). Klapp, Mathias A ; Toriello, Alejandro ; Erera, Alan L.
    In: Transportation Science.
    RePEc:inm:ortrsc:v:52:y:2018:i:2:p:402-415.

    Full description at Econpapers || Download paper

19. A non-myopic dynamic inventory routing and pricing problem. (2018). Gao, Oliver H ; Sayarshad, Hamid R.
    In: Transportation Research Part E: Logistics and Transportation Review.
    RePEc:eee:transe:v:109:y:2018:i:c:p:83-98.

    Full description at Econpapers || Download paper

20. A unified framework for rich routing problems with stochastic demands. (2018). Markov, Iliya ; Maknoon, Yousef ; Varone, Sacha ; Bierlaire, Michel ; Cordeau, Jean-Franois.
    In: Transportation Research Part B: Methodological.
    RePEc:eee:transb:v:114:y:2018:i:c:p:213-240.

    Full description at Econpapers || Download paper

21. A bi-objective stochastic location-inventory-routing model for microalgae-based biofuel supply chain. (2018). Nickel, Stefan ; Sahebi, Hadi ; Habibi, Farhad ; Asadi, Ehsan.
    In: Applied Energy.
    RePEc:eee:appene:v:228:y:2018:i:c:p:2235-2261.

    Full description at Econpapers || Download paper

22. Cyclic Delivery Schedules for an Inventory Routing Problem. (2015). Ozener, Okan Orsan ; Kuyzu, Gultekin ; Ekici, Ali.
    In: Transportation Science.
    RePEc:inm:ortrsc:v:49:y:2015:i:4:p:817-829.

    Full description at Econpapers || Download paper

23. Benders Decomposition for Production Routing Under Demand Uncertainty. (2015). Adulyasak, Yossiri ; Jans, Raf ; Cordeau, Jean-Franois.
    In: Operations Research.
    RePEc:inm:oropre:v:63:y:2015:i:4:p:851-867.

    Full description at Econpapers || Download paper

24. Relaxations of Approximate Linear Programs for the Real Option Management of Commodity Storage. (2015). Nadarajah, Selvaprabu ; Secomandi, Nicola ; Margot, Franois .
    In: Management Science.
    RePEc:inm:ormnsc:v:61:y:2015:i:12:p:3054-3076.

    Full description at Econpapers || Download paper

25. Simulation-Based Approximate Policy Iteration with Generalized Logistic Functions. (2015). Puterman, Martin L ; Patrick, Jonathan ; Saure, Antoine.
    In: INFORMS Journal on Computing.
    RePEc:inm:orijoc:v:27:y:2015:i:3:p:579-595.

    Full description at Econpapers || Download paper

26. Thirty Years of Inventory Routing. (2014). Coelho, Leandro C ; Cordeau, Jean-Franois ; Laporte, Gilbert.
    In: Transportation Science.
    RePEc:inm:ortrsc:v:48:y:2014:i:1:p:1-19.

    Full description at Econpapers || Download paper

27. A Dynamic Traveling Salesman Problem with Stochastic Arc Costs. (2014). Haskell, William B ; Poremba, Michael ; Toriello, Alejandro.
    In: Operations Research.
    RePEc:inm:oropre:v:62:y:2014:i:5:p:1107-1125.

    Full description at Econpapers || Download paper

28. The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty. (2013). Wiesemann, Wolfram ; Gounaris, Chrysanthos E ; Floudas, Christodoulos A.
    In: Operations Research.
    RePEc:inm:oropre:v:61:y:2013:i:3:p:677-693.

    Full description at Econpapers || Download paper

29. A Linear Programming Approach to Nonstationary Infinite-Horizon Markov Decision Processes. (2013). Smith, Robert L ; Ghate, Archis.
    In: Operations Research.
    RePEc:inm:oropre:v:61:y:2013:i:2:p:413-425.

    Full description at Econpapers || Download paper

30. Large scale stochastic inventory routing problems with split delivery and service level constraints. (2012). Yu, Yugang ; Chen, Haoxun ; Chu, Feng.
    In: Annals of Operations Research.
    RePEc:spr:annopr:v:197:y:2012:i:1:p:135-158:10.1007/s10479-010-0772-4.

    Full description at Econpapers || Download paper

31. Robust Inventory Routing Under Demand Uncertainty. (2012). Solyali, Ouz ; Cordeau, Jean-Franois ; Laporte, Gilbert.
    In: Transportation Science.
    RePEc:inm:ortrsc:v:46:y:2012:i:3:p:327-340.

    Full description at Econpapers || Download paper

32. Computing Near-Optimal Policies in Generalized Joint Replenishment. (2012). Klabjan, Diego ; Adelman, Daniel.
    In: INFORMS Journal on Computing.
    RePEc:inm:orijoc:v:24:y:2012:i:1:p:148-164.

    Full description at Econpapers || Download paper

33. A Branch-and-Cut Algorithm Using a Strong Formulation and an A Priori Tour-Based Heuristic for an Inventory-Routing Problem. (2011). Solyali, Ouz ; Sural, Haldun.
    In: Transportation Science.
    RePEc:inm:ortrsc:v:45:y:2011:i:3:p:335-345.

    Full description at Econpapers || Download paper

34. Approximate Dynamic Programming for Ambulance Redeployment. (2010). Henderson, Shane G ; Maxwell, Matthew S ; Restrepo, Mateo ; Topaloglu, Huseyin.
    In: INFORMS Journal on Computing.
    RePEc:inm:orijoc:v:22:y:2010:i:2:p:266-281.

    Full description at Econpapers || Download paper

35. Feature Article ---Merging AI and OR to Solve High-Dimensional Stochastic Optimization Problems Using Approximate Dynamic Programming. (2010). Powell, Warren B.
    In: INFORMS Journal on Computing.
    RePEc:inm:orijoc:v:22:y:2010:i:1:p:2-17.

    Full description at Econpapers || Download paper

36. Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands. (2009). Secomandi, Nicola ; Margot, Franois .
    In: Operations Research.
    RePEc:inm:oropre:v:57:y:2009:i:1:p:214-230.

    Full description at Econpapers || Download paper

37. Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems. (2009). Hvattum, Lars Magnus ; Laporte, Gilbert ; Lokketangen, Arne.
    In: INFORMS Journal on Computing.
    RePEc:inm:orijoc:v:21:y:2009:i:2:p:268-285.

    Full description at Econpapers || Download paper

38. Route Design for Lean Production Systems. (2008). Fry, Michael J ; Ohlmann, Jeffrey W ; Thomas, Barrett W.
    In: Transportation Science.
    RePEc:inm:ortrsc:v:42:y:2008:i:3:p:352-370.

    Full description at Econpapers || Download paper

39. Dynamic Multipriority Patient Scheduling for a Diagnostic Resource. (2008). Queyranne, Maurice ; Puterman, Martin L ; Patrick, Jonathan.
    In: Operations Research.
    RePEc:inm:oropre:v:56:y:2008:i:6:p:1507-1525.

    Full description at Econpapers || Download paper

40. Relaxations of Weakly Coupled Stochastic Dynamic Programs. (2008). Adelman, Daniel ; Mersereau, Adam J.
    In: Operations Research.
    RePEc:inm:oropre:v:56:y:2008:i:3:p:712-727.

    Full description at Econpapers || Download paper

41. A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem. (2007). Speranza, Maria Grazia ; Bertazzi, Luca ; Laporte, Gilbert ; Archetti, Claudia.
    In: Transportation Science.
    RePEc:inm:ortrsc:v:41:y:2007:i:3:p:382-391.

    Full description at Econpapers || Download paper

42. Performance Measurement for Inventory Routing. (2007). Savelsbergh, Martin ; Song, Jin-Hwa .
    In: Transportation Science.
    RePEc:inm:ortrsc:v:41:y:2007:i:1:p:44-54.

    Full description at Econpapers || Download paper

43. Price-Directed Control of a Closed Logistics Queueing Network. (2007). Adelman, Daniel.
    In: Operations Research.
    RePEc:inm:oropre:v:55:y:2007:i:6:p:1022-1038.

    Full description at Econpapers || Download paper

44. Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching. (2006). Ichoua, Soumia ; Gendreau, Michel ; Potvin, Jean-Yves.
    In: Transportation Science.
    RePEc:inm:ortrsc:v:40:y:2006:i:2:p:211-225.

    Full description at Econpapers || Download paper

45. A Cost-Shaping Linear Program for Average-Cost Approximate Dynamic Programming with Performance Guarantees. (2006). de Farias, Daniela Pucci ; van Roy, Benjamin.
    In: Mathematics of Operations Research.
    RePEc:inm:ormoor:v:31:y:2006:i:3:p:597-620.

    Full description at Econpapers || Download paper

Report date: 2025-09-23 08:40:17 || Missing content? Let us know