create a website

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

Cited: 0

Citations received by this document

Cites: 45

References cited by this document

Cocites: 45

Documents which have cited the same bibliography

Coauthors: 0

Authors who have wrote about the same topic

Citations

Citations received by this document

    This document has not been cited yet.

References

References cited by this document

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

  2. Adelman, D. Dynamic Bid Prices in Revenue Management. Oper. Res. 2007, 55, 647–661. [CrossRef]

  3. Adelman, D.; Klabjan, D. Computing Near-Optimal Policies in Generalized Joint Replenishment. INFORMS J. Comput. 2011, 24, 148–164. [CrossRef]
    Paper not yet in RePEc: Add citation now

  4. Bitran, G.R.; Dasu, S. Ordering policies in an environment of stochastic yields and substitutable demands. Oper. Res. 1992, 40, 999–1017. [CrossRef]

  5. Bitran, G.R.; Leong, T.Y. Deterministic approximations to co-production problems with service constraints and random yields. Manag. Sci. 1992, 38, 724–742. [CrossRef]

  6. Cattrysse, D.; Maes, J.; Wassenhove, L. Set partitioning and column generation heuristics for capacitated dynamic lotsizing. Eur. J. Oper. Res. 1990, 46, 38–47. [CrossRef]

  7. Dan, Z. An Improved Dynamic Programming Decomposition Approach for Network Revenue Management. Manuf. Serv. Oper. Manag. 2011, 13, 35–52.
    Paper not yet in RePEc: Add citation now

  8. De Farias, D.P.; Van Roy, B. On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming. Math. Oper. Res. 2004, 29, 462–478. [CrossRef]

  9. Denardo, E.V. On linear programming in a markov decision problem. Manag. Sci. 1970, 16, 281–288. [CrossRef]

  10. Desai, V.V.; Farias, V.F.; Moallemi, C.C. Approximate Dynamic Programming via a Smoothed Linear Program. Oper. Res. 2012, 60, 655–674. [CrossRef]
    Paper not yet in RePEc: Add citation now

  11. Diaby, M.; Bahl, H.C.; Karwan, M.H.; Zionts, S. Capacitated lot-sizing and scheduling by Lagrangean relaxation. Eur. J. Oper. Res. 1992, 59, 444–458. [CrossRef]

  12. Drexl, A.; Kimms, A. Lot sizing and scheduling: Survey and extensions. Eur. J. Oper. Res. 1997, 99, 221–235. [CrossRef]

  13. Farias, D.P.D.; Roy, B.V. A Cost-Shaping Linear Program for Average-Cost Approximate Dynamic Programming with Performance Guarantees. Math. Oper. Res. 2006, 31, 597–620. [CrossRef]
    Paper not yet in RePEc: Add citation now
  14. Farias, D.P.D.; Roy, B.V. The Linear Programming Approach to Approximate Dynamic Programming. Oper. Res. 2003, 51, 850–865. [CrossRef]
    Paper not yet in RePEc: Add citation now

  15. Fleischmann, B. The discrete lot-sizing and scheduling problem with sequence-dependent setup costs. Eur. J. Oper. Res. 1994, 75, 395–404. [CrossRef]

  16. Gelders, L.F.; Wassenhove, L.N.V. Production planning: A review. Eur. J. Oper. Res. 1981, 7, 101–110. [CrossRef]

  17. Han, J.; Roy, B.V. Control of Diffusions via Linear Programming; Stochastic Programming: New York, NY, USA, 2011; pp. 329–353.
    Paper not yet in RePEc: Add citation now

  18. Karabuk, S.; Wu, S.D. Coordinating strategic capacity planning in the semiconductor industry. Oper. Res. 2003, 51, 839–849. [CrossRef]

  19. Kelle, P.; Milne, A. The effect of (s, S) ordering policy on the supply chain. Int. J. Prod. Econ. 1999, 59, 113–122. [CrossRef]

  20. Longstaff, F.A.; Schwartz, E.S. Valuing American Options by Simulation: A Simple Least-Squares Approach. Rev. Financ. Stud. 2001, 14, 113–147. [CrossRef] Mathematics 2024, 12, 3922 17 of 17

  21. Manne, A.S. Linear Programming and Sequential Decisions. Manag. Sci. 1960, 6, 259–267. [CrossRef]
    Paper not yet in RePEc: Add citation now

  22. Morrison, J.R.; Kumar, P.R. New linear program performance bounds for queueing networks. J. Optim. Theory Appl. 1999, 100, 575–597. [CrossRef]

  23. Mula, J.; Poler, R.; García-Sabater, J.; Lario, F.C. Models for production planning under uncertainty: A review. Int. J. Prod. Econ. 2006, 103, 271–285. [CrossRef]

  24. Murota, K. Discrete convex analysis. Math. Program. 1998, 83, 313–371. [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
  25. Petrik, M.; Zilberstein, S. Constraint relaxation in approximate linear programs. In Proceedings of the 26th Annual Inernational Conference on Machine Learning, Montreal, QC, Canada, 14–18 June 2009; pp. 809–816.
    Paper not yet in RePEc: Add citation now

  26. Porteus, E.L. Optimal Lot Sizing, Process Quality Improvement and Setup Cost Reduction. Oper. Res. 1986, 34, 137–144. [CrossRef]

  27. Powell, W.B. Approximate dynamic programming: Solving the curses of dimensionality. Optim. Methods Softw. 2007, 24, 155.
    Paper not yet in RePEc: Add citation now

  28. Salomon, M.; Kroon, L.G.; Wassenhove, K.L.N.V. Some extensions of the discrete lotsizing and scheduling problem. Manag. Sci. 1991, 37, 801–812. [CrossRef]

  29. Salomon, M.; Solomon, M.M.; Wassenhove, L.; Dumas, Y.; Dauzère-Pérès, S. Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the Travelling Salesman Problem with time windows. Eur. J. Oper. Res. 1997, 100, 494–513. [CrossRef]

  30. Schweitzer, P.J.; Seidmann, A. Generalized polynomial approximations in Markovian decision processes. J. Math. Anal. Appl. 1985, 110, 568–582. [CrossRef]
    Paper not yet in RePEc: Add citation now
  31. Sepehri, M.; Silver, E.A.; New, C. A heuristic for multiple lot sizing for an order under variable yield. IIE Trans. 1986, 18, 63–69. [CrossRef]
    Paper not yet in RePEc: Add citation now

  32. SimaO, H.P.; George, A.; Powell, W.B.; Gifford, T.; Nienow, J.; Day, J. Approximate Dynamic Programming Captures Fleet Operations for Schneider National. Interfaces 2010, 40, 342–352. [CrossRef]

  33. Tesauro, G. Temporal difference learning and TD-Gammon. Commun. ACM 1995, 38, 58–68. [CrossRef]
    Paper not yet in RePEc: Add citation now
  34. Topaloglu, H. Using Lagrangian Relaxation to Compute Capacity-Dependent Bid Prices in Network Revenue Management. Oper. Res. 2009, 57, 637–649. [CrossRef]
    Paper not yet in RePEc: Add citation now
  35. Tsitsiklis, J.N.; Roy, B.V. Optimal Stopping of Markov Processes: Hilbert Space Theory, Approximation Algorithms, and an Application to Pricing High-Dimensional Financial Derivatives. IEEE Trans. Autom. Control. 1999, 44, 1840–1851. [CrossRef]
    Paper not yet in RePEc: Add citation now
  36. Tsitsiklis, J.N.; Roy, B.V. Regression Methods for Pricing Complex American Style Options. IEEE Trans. Neural Netw. 2001, 12, 694–703. [CrossRef] [PubMed]
    Paper not yet in RePEc: Add citation now
  37. Uzsoy, R.; Lee, C.Y.; Martin-Vega, L.A. A review of production planning and scheduling models in the semiconductor industry Part I: System characteristics, performance evaluation and production planning. IIE Trans. 1992, 24, 47–60. [CrossRef]
    Paper not yet in RePEc: Add citation now
  38. Van Roy, B. Neuro-Dynamic Programming: Overview and Recent Trends. In Handbook of Markov Decision Processes; Springer: Boston, MA, USA, 2002; pp. 431–459.
    Paper not yet in RePEc: Add citation now
  39. Veatch, M.H. Approximate dynamic programming for networks: Fluid models and constraint reduction. 2004, submitted for publication.
    Paper not yet in RePEc: Add citation now

  40. Vossen, T.W.M.; Zhang, D. A Dynamic Disaggregation Approach to Approximate Linear Programs for Network Revenue Management. Prod. Oper. Manag. 2015, 24, 469–487. [CrossRef]

  41. Wagner, H.M. Research portfolio for inventory management and production planning systems. Oper. Res. 1980, 28, 445–475. [CrossRef]

  42. Wen, Z.; Durlofsky, L.J.; Roy, B.V.; Aziz, K. Approximate Dynamic Programming for Optimizing Oil Production; John Wiley and Sons: Hoboken, NJ, USA, 2013.
    Paper not yet in RePEc: Add citation now
  43. Yanasse, B. Computational Complexity of the Capacitated Lot Size Problem. Manag. Sci. 1982, 28, 1174–1186. Mathematics 2024, 12, 3922 16 of 17
    Paper not yet in RePEc: Add citation now

  44. Zhang, D.; Adelman, D. An approximate dynamic programming approach to network revenue management with customer choice. Transp. Sci. 2009, 43, 381–394. [CrossRef]

  45. Zijm, W. Hierarchical production planning and multi-echelon inventory management. Int. J. Prod. Econ. 1992, 26, 257–264. [CrossRef]
    Paper not yet in RePEc: Add citation now

Cocites

Documents in RePEc which have cited the same bibliography

  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

Coauthors

Authors registered in RePEc who have wrote about the same topic

Report date: 2025-09-21 07:33:22 || Missing content? Let us know

CitEc is a RePEc service, providing citation data for Economics since 2001. Last updated August, 3 2024. Contact: Jose Manuel Barrueco.