An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters
Author
Abstract
Suggested Citation
DOI: 10.1016/j.ejor.2016.01.042
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.References listed on IDEAS
- James H. Lorie & Leonard J. Savage, 1955. "Three Problems in Rationing Capital," The Journal of Business, University of Chicago Press, vol. 28, pages 229-229.
- Grothey, Andreas & Yang, Xinan, 2012. "Approximate dynamic programming with Bézier Curves/Surfaces for Top-percentile Traffic Routing," European Journal of Operational Research, Elsevier, vol. 218(3), pages 698-707.
- Dimitris Bertsimas & Ramazan Demir, 2002. "An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems," Management Science, INFORMS, vol. 48(4), pages 550-565, April.
- Dan Zhang & Daniel Adelman, 2009. "An Approximate Dynamic Programming Approach to Network Revenue Management with Customer Choice," Transportation Science, INFORMS, vol. 43(3), pages 381-394, August.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- José García & José Lemus-Romani & Francisco Altimiras & Broderick Crawford & Ricardo Soto & Marcelo Becerra-Rozas & Paola Moraga & Alex Paz Becerra & Alvaro Peña Fritz & Jose-Miguel Rubio & Gino Astor, 2021. "A Binary Machine Learning Cuckoo Search Algorithm Improved by a Local Search Operator for the Set-Union Knapsack Problem," Mathematics, MDPI, vol. 9(20), pages 1-19, October.
- Yanhong Feng & Haizhong An & Xiangyun Gao, 2018. "The Importance of Transfer Function in Solving Set-Union Knapsack Problem Based on Discrete Moth Search Algorithm," Mathematics, MDPI, vol. 7(1), pages 1-25, December.
- José García & Andres Leiva-Araos & Broderick Crawford & Ricardo Soto & Hernan Pinto, 2023. "Exploring Initialization Strategies for Metaheuristic Optimization: Case Study of the Set-Union Knapsack Problem," Mathematics, MDPI, vol. 11(12), pages 1-20, June.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Dragos Florin Ciocan & Vivek Farias, 2012. "Model Predictive Control for Dynamic Resource Allocation," Mathematics of Operations Research, INFORMS, vol. 37(3), pages 501-525, August.
- Sabah Bushaj & İ. Esra Büyüktahtakın, 2024. "A K-means Supported Reinforcement Learning Framework to Multi-dimensional Knapsack," Journal of Global Optimization, Springer, vol. 89(3), pages 655-685, July.
- Tobin, Roger L., 1999. "A fast interactive solution method for large capital expenditure selection problems," European Journal of Operational Research, Elsevier, vol. 116(1), pages 1-15, July.
- Jing Wu & Lijie Su & Gongshu Wang & Yang Yang, 2024. "Approximated Dynamic Programming for Production and Inventory Planning Problem in Cold Rolling Process of Steel Production," Mathematics, MDPI, vol. 12(24), pages 1-17, December.
- Chen, Shijie & Rahman, Md Hishamur & Marković, Nikola & Siddiqui, Muhammad Imran Younus & Mohebbi, Matthew & Sun, Yanshuo, 2024. "Schedule negotiation with ADA paratransit riders under value of time uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 184(C).
- Deng, Qichen & Santos, Bruno F., 2022. "Lookahead approximate dynamic programming for stochastic aircraft maintenance check scheduling optimization," European Journal of Operational Research, Elsevier, vol. 299(3), pages 814-833.
- Hanafi, Said & Freville, Arnaud, 1998. "An efficient tabu search approach for the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 659-675, April.
- Thomas W. M. Vossen & Dan Zhang, 2015. "Reductions of Approximate Linear Programs for Network Revenue Management," Operations Research, INFORMS, vol. 63(6), pages 1352-1371, December.
- David Simchi-Levi & Rui Sun & Huanan Zhang, 2022. "Online Learning and Optimization for Revenue Management Problems with Add-on Discounts," Management Science, INFORMS, vol. 68(10), pages 7402-7421, October.
- Guang Li & Paat Rusmevichientong & Huseyin Topaloglu, 2015. "The d -Level Nested Logit Model: Assortment and Price Optimization Problems," Operations Research, INFORMS, vol. 63(2), pages 325-342, April.
- Gino Favero & Gherardo Piacitelli, 2024. "Irr and equivalence of cash-flow streams, loans, and portfolios of bonds," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 47(2), pages 379-399, December.
- E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
- Ruxian Wang & Maqbool Dada & Ozge Sahin, 2019. "Pricing Ancillary Service Subscriptions," Management Science, INFORMS, vol. 65(10), pages 4712-4732, October.
- D. Babusiaux, 1988. "Financing investment and calculations of profitability [Financement des investissements et calculs de rentabilité]," Working Papers hal-01534450, HAL.
- Marc Bertonèche & Herwig Langohr, 1977. "Le choix des investissements en situation de rationnement du capital : comparaison des solutions fournies par différents modèles théoriques," Revue Économique, Programme National Persée, vol. 28(5), pages 730-764.
- Osborne, Michael J., 2010. "A resolution to the NPV-IRR debate?," The Quarterly Review of Economics and Finance, Elsevier, vol. 50(2), pages 234-239, May.
- Chevalier, Philippe & Lamas, Alejandro & Lu, Liang & Mlinar, Tanja, 2015.
"Revenue management for operations with urgent orders,"
European Journal of Operational Research, Elsevier, vol. 240(2), pages 476-487.
- LAMAS, Alejandro & MLINAR, Tanja & CHEVALIER, Philippe, 2013. "Revenue management for operations with urgent orders," LIDAM Discussion Papers CORE 2013046, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- CHEVALIER, Philippe & LAMAS, Alejandro & LU, Lian & MLINAR, Tanja, 2015. "Revenue management for operations with urgent orders," LIDAM Reprints CORE 2628, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Bertazzi, Luca & Bosco, Adamo & Laganà, Demetrio, 2015. "Managing stochastic demand in an Inventory Routing Problem with transportation procurement," Omega, Elsevier, vol. 56(C), pages 112-121.
- Christiane Barz & Jochen Gönsch & Davina Rauhaus & Siqi He, 2025. "Dynamic pricing with (extra) seat reservations under the nested logit model," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 47(4), pages 1133-1179, December.
- Gustavo Vulcano & Garrett van Ryzin & Wassim Chaar, 2010. "OM Practice--Choice-Based Revenue Management: An Empirical Study of Estimation and Optimization," Manufacturing & Service Operations Management, INFORMS, vol. 12(3), pages 371-392, February.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:252:y:2016:i:3:p:985-994. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.
Printed from https://ideas.repec.org/a/eee/ejores/v252y2016i3p985-994.html