Juan José Miranda-Bront

Juan José Miranda-Bront

Auto-generated profile, based on publicly available information

Juan José Miranda-Bront

Departamento de Computación, FCEyN, Universidad de Buenos Aires, Ciudad Autónoma de Buenos Aires, Argentina

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2009 in Operations Research
Verified
Journal Article
Closed access
JBJuan José Miranda Bront
Juan José Miranda Bront
IMIsabel Méndez-Díaz
Isabel Méndez-Díaz
GVGustavo Vulcano
Gustavo Vulcano
During the past few years, there has been a trend to enrich traditional revenue management models built upon the independent demand paradigm by accounting for customer choice behavior. This extension involves both modeling and computational challenges. One way to describe choice behavior is to assume that each customer belongs to a segment, which is characterized by a consideration set, i.e., a subset of the products provided by the firm that a customer views as options. Customers choose a particular product according to a multinomial-logit criterion, a model widely used in the marketing literature. In this paper, we consider the choice-based, deterministic, linear programming model (CDLP) of Gallego et al. (2004) [Gallego, G., G. Iyengar, R. Phillips, A. Dubey. 2004. Managing flexible products on a network. Technical Report CORC TR-2004-01, Department of Industrial Engineering and Operations Research, Columbia University, New York], and the follow-up dynamic programming decomposition heuristic of van Ryzin and Liu (2008) [van Ryzin, G. J., Q. Liu. 2008. On the choice-based linear programming model for network revenue management. Manufacturing Service Oper. Management 10(2) 288–310]. We focus on the more general version of these models, where customers belong to overlapping segments. To solve the CDLP for real-size networks, we need to develop a column generation algorithm. We prove that the associated column generation subproblem is indeed NP-hard and propose a simple, greedy heuristic to overcome the complexity of an exact algorithm. Our computational results show that the heuristic is quite effective and that the overall approach leads to high-quality, practical solutions.

1 February 2014 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
IMIsabel Méndez-Díaz
Isabel Méndez-Díaz
JMJuan José Miranda-Bront
Juan José Miranda-Bront
GVGustavo Vulcano
Gustavo Vulcano
PZPaula Zabala
Paula Zabala

13 July 2023 in European Journal of Operational Research
Verified
Journal Article
Closed access
GLGonzalo Lera-Romero
Gonzalo Lera-Romero
JBJuan José Miranda Bront
Juan José Miranda Bront
FSFrancisco J. Soulignac
Francisco J. Soulignac

28 May 2016 in Annals of Operations Research
Verified
Journal Article
Closed access
PDF file
JMJuan José Miranda-Bront
Juan José Miranda-Bront
BCBrian Curcio
Brian Curcio
IMIsabel Méndez-Díaz
Isabel Méndez-Díaz
AMAgustín Montero
Agustín Montero
FPFederico Pousa
Federico Pousa
PZPaula Zabala
Paula Zabala

1 December 2017 in Computers & Operations Research
Verified
Journal Article
Closed access
AMAgustín Montero
Agustín Montero
IMIsabel Méndez-Díaz
Isabel Méndez-Díaz
JMJuan José Miranda-Bront
Juan José Miranda-Bront

1 December 2016 in Computers & Operations Research
Verified
Journal Article
Closed access
IMIsabel Méndez-Díaz
Isabel Méndez-Díaz
PZPaula Zabala
Paula Zabala
JMJuan José Miranda-Bront
Juan José Miranda-Bront