Juan José Miranda Bront
(Juan Jose Miranda Bront)

Personal Details

First Name:	Juan Jose
Middle Name:
Last Name:	Miranda Bront
Suffix:
RePEc Short-ID:	pmi1026
	https://jjmiranda.bitbucket.io/

Affiliation

Escuela de Negocios
Universidad Torcuato Di Tella

Buenos Aires, Argentina
http://www.utdt.edu//ver_contenido.php?id_contenido=100&id_item_menu=429
RePEc:edi:eeutdar (more details at EDIRC)

Citations

Many of the citations below have been collected in an experimental project, CitEc, where a more detailed citation analysis can be found. These are citations from works listed in RePEc that could be analyzed mechanically. So far, only a minority of all works could be analyzed. See under "Corrections" how you can help improve the citation analysis.

Articles

1. Lera-Romero, Gonzalo & Miranda-Bront, Juan José, 2021. "A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints," European Journal of Operational Research, Elsevier, vol. 289(3), pages 879-896.

   Cited by:

   1. Gonzalo Lera-Romero & Juan José Miranda Bront & Francisco J. Soulignac, 2022. "Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3292-3308, November.

2. Juan José Miranda-Bront & Brian Curcio & Isabel Méndez-Díaz & Agustín Montero & Federico Pousa & Paula Zabala, 2017. "A cluster-first route-second approach for the swap body vehicle routing problem," Annals of Operations Research, Springer, vol. 253(2), pages 935-956, June.

   Cited by:

   1. Sandra Huber & Jean-François Cordeau & Martin Josef Geiger, 2020. "A matheuristic for the swap body vehicle routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(1), pages 111-160, March.
   2. Bhoopalam, Anirudh Kishore & Agatz, Niels & Zuidwijk, Rob, 2018. "Planning of truck platoons: A literature review and directions for future research," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 212-228.
   3. Tsang, Man Yiu & Shehadeh, Karmel S., 2023. "Stochastic optimization models for a home service routing and appointment scheduling problem with random travel and service times," European Journal of Operational Research, Elsevier, vol. 307(1), pages 48-63.
   4. Kishore Bhoopalam, A. & Agatz, N.A.H. & Zuidwijk, R.A., 2017. "Planning of Truck Platoons: a Literature Review and Directions for Future Research," ERIM Report Series Research in Management ERS-2017-010-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.

3. Agustín Montero & Juan José Miranda-Bront & Isabel Méndez-Díaz, 2017. "An ILP-based local search procedure for the VRP with pickups and deliveries," Annals of Operations Research, Springer, vol. 259(1), pages 327-350, December.

   Cited by:

   1. Yichen Lu & Chao Yang & Jun Yang, 2022. "A multi-objective humanitarian pickup and delivery vehicle routing problem with drones," Annals of Operations Research, Springer, vol. 319(1), pages 291-353, December.
   2. Yong Wang & Qin Li & Xiangyang Guan & Jianxin Fan & Yong Liu & Haizhong Wang, 2020. "Collaboration and Resource Sharing in the Multidepot Multiperiod Vehicle Routing Problem with Pickups and Deliveries," Sustainability, MDPI, vol. 12(15), pages 1-33, July.
   3. Qiuping Ni & Yuanxiang Tang, 2023. "A Bibliometric Visualized Analysis and Classification of Vehicle Routing Problem Research," Sustainability, MDPI, vol. 15(9), pages 1-37, April.
   4. Xuhong Cai & Li Jiang & Songhu Guo & Hejiao Huang & Hongwei Du, 2022. "TLHSA and SACA: two heuristic algorithms for two variant VRP models," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2996-3022, November.

4. Miranda-Bront, Juan José & Méndez-Díaz, Isabel & Zabala, Paula, 2014. "Facets and valid inequalities for the time-dependent travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 236(3), pages 891-902.

   Cited by:

   1. Jan Mikula & Miroslav Kulich, 2022. "Solving the traveling delivery person problem with limited computational time," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 30(4), pages 1451-1481, December.
   2. Vu, Duc Minh & Hewitt, Mike & Vu, Duc D., 2022. "Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery," European Journal of Operational Research, Elsevier, vol. 302(3), pages 831-846.
   3. Kinable, Joris & Cire, Andre A. & van Hoeve, Willem-Jan, 2017. "Hybrid optimization methods for time-dependent sequencing problems," European Journal of Operational Research, Elsevier, vol. 259(3), pages 887-897.
   4. Cacchiani, Valentina & Contreras-Bolton, Carlos & Toth, Paolo, 2020. "Models and algorithms for the Traveling Salesman Problem with Time-dependent Service times," European Journal of Operational Research, Elsevier, vol. 283(3), pages 825-843.
   5. Albert Einstein Fernandes Muritiba & Tibérius O. Bonates & Stênio Oliveira Da Silva & Manuel Iori, 2021. "Branch-and-Cut and Iterated Local Search for the Weighted k -Traveling Repairman Problem: An Application to the Maintenance of Speed Cameras," Transportation Science, INFORMS, vol. 55(1), pages 139-159, 1-2.
   6. Lera-Romero, Gonzalo & Miranda-Bront, Juan José, 2021. "A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints," European Journal of Operational Research, Elsevier, vol. 289(3), pages 879-896.

5. Juan José Miranda Bront & Isabel Méndez-Díaz & Gustavo Vulcano, 2009. "A Column Generation Algorithm for Choice-Based Network Revenue Management," Operations Research, INFORMS, vol. 57(3), pages 769-784, June.

   Cited by:

   1. Sumit Kunnumkal & Kalyan Talluri, 2019. "Choice Network Revenue Management Based on New Tractable Approximations," Transportation Science, INFORMS, vol. 53(6), pages 1591-1608, November.
   2. Gerardo Berbeglia & Alvaro Flores & Guillermo Gallego, 2021. "The Refined Assortment Optimization Problem," Papers 2102.03043, arXiv.org.
   3. Lin, Yun Hui & Wang, Yuan & He, Dongdong & Lee, Loo Hay, 2020. "Last-mile delivery: Optimal locker location under multinomial logit choice model," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
   4. Sumit Kunnumkal & Kalyan Talluri, 2016. "Technical Note—A Note on Relaxations of the Choice Network Revenue Management Dynamic Program," Operations Research, INFORMS, vol. 64(1), pages 158-166, February.
   5. Flores, Alvaro & Berbeglia, Gerardo & Van Hentenryck, Pascal, 2019. "Assortment optimization under the Sequential Multinomial Logit Model," European Journal of Operational Research, Elsevier, vol. 273(3), pages 1052-1064.
   6. Agrawal, Deepak & Pang, Guodong & Kumara, Soundar, 2023. "Preference based scheduling in a healthcare provider network," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1318-1335.
   7. Felipe Caro & Victor Martínez-de-Albéniz & Paat Rusmevichientong, 2014. "The Assortment Packing Problem: Multiperiod Assortment Planning for Short-Lived Products," Management Science, INFORMS, vol. 60(11), pages 2701-2721, November.
   8. Georg Bechler & Claudius Steinhardt & Jochen Mackert, 2021. "On the Linear Integration of Attraction Choice Models in Business Optimization Problems," SN Operations Research Forum, Springer, vol. 2(1), pages 1-13, March.
   9. Andrés Abeliuk & Gerardo Berbeglia & Manuel Cebrian & Pascal Van Hentenryck, 2016. "Assortment optimization under a multinomial logit model with position bias and social influence," 4OR, Springer, vol. 14(1), pages 57-75, March.
   10. Erfan Mehmanchi & Andrés Gómez & Oleg A. Prokopyev, 2019. "Fractional 0–1 programs: links between mixed-integer linear and conic quadratic formulations," Journal of Global Optimization, Springer, vol. 75(2), pages 273-339, October.
   11. Sumit Kunnumkal & Victor Martínez-de-Albéniz, 2019. "Tractable Approximations for Assortment Planning with Product Costs," Operations Research, INFORMS, vol. 67(2), pages 436-452, March.
   12. Wuyang Yuan & Lei Nie & Xin Wu & Huiling Fu, 2018. "A dynamic bid price approach for the seat inventory control problem in railway networks with consideration of passenger transfer," PLOS ONE, Public Library of Science, vol. 13(8), pages 1-23, August.
   13. Ali Aouad & Vivek Farias & Retsef Levi, 2021. "Assortment Optimization Under Consider-Then-Choose Choice Models," Management Science, INFORMS, vol. 67(6), pages 3368-3386, June.
   14. Fernando Bernstein & A. Gürhan Kök & Lei Xie, 2015. "Dynamic Assortment Customization with Limited Inventories," Manufacturing & Service Operations Management, INFORMS, vol. 17(4), pages 538-553, October.
   15. Mika Sumida & Guillermo Gallego & Paat Rusmevichientong & Huseyin Topaloglu & James Davis, 2021. "Revenue-Utility Tradeoff in Assortment Optimization Under the Multinomial Logit Model with Totally Unimodular Constraints," Management Science, INFORMS, vol. 67(5), pages 2845-2869, May.
   16. Ali Aouad & Jacob Feldman & Danny Segev, 2023. "The Exponomial Choice Model for Assortment Optimization: An Alternative to the MNL Model?," Management Science, INFORMS, vol. 69(5), pages 2814-2832, May.
   17. James M. Davis & Guillermo Gallego & Huseyin Topaloglu, 2014. "Assortment Optimization Under Variants of the Nested Logit Model," Operations Research, INFORMS, vol. 62(2), pages 250-273, April.
   18. Guillermo Gallego & Michael Z. F. Li & Yan Liu, 2020. "Dynamic Nonlinear Pricing of Inventories over Finite Sales Horizons," Operations Research, INFORMS, vol. 68(3), pages 655-670, May.
   19. 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.
   20. Guillermo Gallego & Huseyin Topaloglu, 2014. "Constrained Assortment Optimization for the Nested Logit Model," Management Science, INFORMS, vol. 60(10), pages 2583-2601, October.
   21. Tiwari, Richa & Jayaswal, Sachin & Sinha, Ankur, 2021. "Alternate solution approaches for competitive hub location problems," European Journal of Operational Research, Elsevier, vol. 290(1), pages 68-80.
   22. Gallego, Guillermo & Li, Anran & Truong, Van-Anh & Wang, Xinshang, 2020. "Approximation algorithms for product framing and pricing," LSE Research Online Documents on Economics 101983, London School of Economics and Political Science, LSE Library.
   23. Muzaffer Buyruk & Ertan Güner, 2022. "Personalization in airline revenue management: an overview and future outlook," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 21(2), pages 129-139, April.
   24. Dan Zhang & Larry Weatherford, 2017. "Dynamic Pricing for Network Revenue Management: A New Approach and Application in the Hotel Industry," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 18-35, February.
   25. Koch, Sebastian & Klein, Robert, 2020. "Route-based approximate dynamic programming for dynamic pricing in attended home delivery," European Journal of Operational Research, Elsevier, vol. 287(2), pages 633-652.
   26. Thibault Barbier & Miguel Anjos & Fabien Cirinei & Gilles Savard, 2019. "Fluid arrivals simulation for choice network revenue management," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 18(2), pages 164-180, April.
   27. Sebastian Koch & Jochen Gönsch & Michael Hassler & Robert Klein, 2016. "Practical decision rules for risk-averse revenue management using simulation-based optimization," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 15(6), pages 468-487, December.
   28. Juan S. Borrero & Colin Gillen & Oleg A. Prokopyev, 2017. "Fractional 0–1 programming: applications and algorithms," Journal of Global Optimization, Springer, vol. 69(1), pages 255-282, September.
   29. Jacob B. Feldman & Huseyin Topaloglu, 2015. "Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model," Operations Research, INFORMS, vol. 63(4), pages 812-822, August.
   30. Wuyang Yuan & Lei Nie, 2020. "Optimization of seat allocation with fixed prices: An application of railway revenue management in China," PLOS ONE, Public Library of Science, vol. 15(4), pages 1-25, April.
   31. Xi Chen & Chao Shi & Yining Wang & Yuan Zhou, 2021. "Dynamic Assortment Planning Under Nested Logit Models," Production and Operations Management, Production and Operations Management Society, vol. 30(1), pages 85-102, January.
   32. Dan Zhang, 2011. "An Improved Dynamic Programming Decomposition Approach for Network Revenue Management," Manufacturing & Service Operations Management, INFORMS, vol. 13(1), pages 35-52, April.
   33. Guillermo Gallego & Richard Ratliff & Sergey Shebalov, 2015. "A General Attraction Model and Sales-Based Linear Program for Network Revenue Management Under Customer Choice," Operations Research, INFORMS, vol. 63(1), pages 212-232, February.
   34. Fatemeh Nosrat & William L. Cooper & Zizhuo Wang, 2021. "Pricing for a product with network effects and mixed logit demand," Naval Research Logistics (NRL), John Wiley & Sons, vol. 68(2), pages 159-182, March.
   35. Nicolas Houy & François Le Grand, 2015. "The Monte Carlo first-come-first-served heuristic for network revenue management," Working Papers halshs-01155698, HAL.
   36. Çömez-Dolgan, Nagihan & Moussawi-Haidar, Lama & Jaber, Mohamad Y. & Cephe, Ecem, 2022. "Capacitated assortment planning of a multi-location system under transshipments," International Journal of Production Economics, Elsevier, vol. 251(C).
   37. Paat Rusmevichientong & Zuo-Jun Max Shen & David B. Shmoys, 2010. "Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint," Operations Research, INFORMS, vol. 58(6), pages 1666-1680, December.
   38. Peter Seele & Claus Dierksmeier & Reto Hofstetter & Mario D. Schultz, 2021. "Mapping the Ethicality of Algorithmic Pricing: A Review of Dynamic and Personalized Pricing," Journal of Business Ethics, Springer, vol. 170(4), pages 697-719, May.
   39. Ali Aouad & Danny Segev, 2021. "Display Optimization for Vertically Differentiated Locations Under Multinomial Logit Preferences," Management Science, INFORMS, vol. 67(6), pages 3519-3550, June.
   40. Amr Farahat & Joonkyum Lee, 2018. "The Multiproduct Newsvendor Problem with Customer Choice," Operations Research, INFORMS, vol. 66(1), pages 123-136, January.
   41. Neda Etebari Alamdari & Gilles Savard, 2021. "Deep reinforcement learning in seat inventory control problem: an action generation approach," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 20(5), pages 566-579, October.
   42. Uzma Mushtaque & Jennifer A. Pazour, 2020. "Random Utility Models with Cardinality Context Effects for Online Subscription Service Platforms," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 19(4), pages 276-290, August.
   43. Kameng Nip & Zhenbo Wang & Zizhuo Wang, 2021. "Assortment Optimization under a Single Transition Choice Model," Production and Operations Management, Production and Operations Management Society, vol. 30(7), pages 2122-2142, July.
   44. Morad Hosseinalifam & Gilles Savard & Patrice Marcotte, 2016. "Computing booking limits under a non-parametric demand model: A mathematical programming approach," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 15(2), pages 170-184, April.
   45. Çömez-Dolgan, Nagihan & Dağ, Hilal & Fescioglu-Unver, Nilgun & Şen, Alper, 2023. "Multi-plant manufacturing assortment planning in the presence of transshipments," European Journal of Operational Research, Elsevier, vol. 310(3), pages 1033-1050.
   46. Dimitris Bertsimas & Velibor V. Mišić, 2019. "Exact First-Choice Product Line Optimization," Operations Research, INFORMS, vol. 67(3), pages 651-670, May.
   47. Mehrani, Saharnaz & Sefair, Jorge A., 2022. "Robust assortment optimization under sequential product unavailability," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1027-1043.
   48. Jacob Feldman & Nan Liu & Huseyin Topaloglu & Serhan Ziya, 2014. "Appointment Scheduling Under Patient Preference and No-Show Behavior," Operations Research, INFORMS, vol. 62(4), pages 794-811, August.
   49. Anton J. Kleywegt & Hongzhang Shao, 2022. "Revenue Management Under the Markov Chain Choice Model with Joint Price and Assortment Decisions," Papers 2204.04774, arXiv.org.
   50. Alper Atamtürk & Andrés Gómez, 2020. "Submodularity in Conic Quadratic Mixed 0–1 Optimization," Operations Research, INFORMS, vol. 68(2), pages 609-630, March.
   51. David Bergman & Andre A. Cire, 2018. "Discrete Nonlinear Optimization by State-Space Decompositions," Management Science, INFORMS, vol. 64(10), pages 4700-4720, October.
   52. Chan, Rebecca & Li, Zhaolin & Matsypura, Dmytro, 2020. "Assortment optimisation problem: A distribution-free approach," Omega, Elsevier, vol. 95(C).
   53. Meng Qi & Ho‐Yin Mak & Zuo‐Jun Max Shen, 2020. "Data‐driven research in retail operations—A review," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(8), pages 595-616, December.
   54. Paat Rusmevichientong & Huseyin Topaloglu, 2012. "Robust Assortment Optimization in Revenue Management Under the Multinomial Logit Choice Model," Operations Research, INFORMS, vol. 60(4), pages 865-882, August.
   55. Klein, Robert & Koch, Sebastian & Steinhardt, Claudius & Strauss, Arne K., 2020. "A review of revenue management: Recent generalizations and advances in industry applications," European Journal of Operational Research, Elsevier, vol. 284(2), pages 397-412.
   56. Sumit Kunnumkal & Kalyan Talluri, 2019. "A strong Lagrangian relaxation for general discrete-choice network revenue management," Computational Optimization and Applications, Springer, vol. 73(1), pages 275-310, May.
   57. Nicolas Houy & François Le Grand, 2015. "Financing and advising with (over)confident entrepreneurs : an experimental investigation," Working Papers 1514, Groupe d'Analyse et de Théorie Economique Lyon St-Étienne (GATE Lyon St-Étienne), Université de Lyon.
   58. Barbier, Thibault & Anjos, Miguel F. & Cirinei, Fabien & Savard, Gilles, 2020. "Product-closing approximation for ranking-based choice network revenue management," European Journal of Operational Research, Elsevier, vol. 286(3), pages 1002-1017.
   59. Strauss, Arne K. & Klein, Robert & Steinhardt, Claudius, 2018. "A review of choice-based revenue management: Theory and methods," European Journal of Operational Research, Elsevier, vol. 271(2), pages 375-387.
   60. Peng Shi, 2022. "Optimal Priority-Based Allocation Mechanisms," Management Science, INFORMS, vol. 68(1), pages 171-188, January.
   61. C. I. Chiang, 2023. "Availability control under online reviews in hospitality," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 22(5), pages 385-398, October.

More information

Research fields, statistics, top rankings, if available.

Statistics

Access and download statistics for all items

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. For general information on how to correct material on RePEc, see these instructions.

To update listings or check citations waiting for approval, Juan Jose Miranda Bront
(Juan Jose Miranda Bront) should log into the RePEc Author Service.

To make corrections to the bibliographic information of a particular item, find the technical contact on the abstract page of that item. There, details are also given on how to add or correct references and citations.

To link different versions of the same work, where versions have a different title, use this form. Note that if the versions have a very similar title and are in the author's profile, the links will usually be created automatically.

Please note that most corrections can take a couple of weeks to filter through the various RePEc services.