@article{Le2026,

title = {Competitive Facility Location Under Cross-Nested Logit Customer Choice Model: Hardness and Exact Approaches},

author = {Ba Luat Le and Tien Mai and Thuy Anh Ta and Minh Hoàng Hà and Duc-Minh Vu},

doi = {10.1287/ijoc.2025.1150},

issn = {1526-5528},

year  = {2026},

date = {2026-05-06},

urldate = {2026-05-06},

journal = {INFORMS Journal on Computing},

publisher = {Institute for Operations Research and the Management Sciences (INFORMS)},

abstract = {<jats:p>We study the competitive facility location problem, in which a firm aims to establish new facilities in a market already occupied by competitors. In this problem, customer behavior is a crucial factor in making optimal location decisions. We explore a general class of customer choice models, known as the cross-nested logit model, which is recognized for its flexibility and generality in predicting people’s choice behavior. To explore the problem, we first demonstrate that it is NP-hard even when there is only one customer class and the cross-nested structure has only two nests. To tackle the challenging facility location problem, we demonstrate that the objective function under a general cross-nested structure is not concave. Interestingly, we show that, by a change of variables, the objective function can be converted to a mixed-integer exponential cone convex program, enabling it to be solved to optimality via an outer approximation algorithm. Extensive experiments show the efficiency of our approach and provide analyses on the benefits of using the cross-nested model in the facility location context.</jats:p>

                  <jats:p>History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms–Discrete.</jats:p>

                  <jats:p>Funding: This work was supported by the Vingroup Innovation Foundation, Vietnam [Grant VINIF.2024.DA072].</jats:p>

                  <jats:p>Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2025.1150 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2025.1150 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .</jats:p>},

keywords = {},

pubstate = {published},

tppubtype = {article}

}

@article{Le2026CFL_CNL,

title = {Competitive Facility Location under Cross-Nested Logit Customer Choice Model: Hardness and Exact Approaches},

author = {Ba Luat Le and Tien Mai and Thuy Anh Ta and Minh Hoang Ha and Duc Minh Vu},

year  = {2026},

date = {2026-01-01},

urldate = {2026-01-01},

journal = {INFORMS Journal on Computing},

note = {Accepted March 2026, to appear},

keywords = {},

pubstate = {published},

tppubtype = {article}

}

@article{Vu2026DemandResponseReview,

title = {Designing effective demand response: A review of behavioral insights, consumer engagement, and operational strategies in energy systems},

author = {Duc D. Vu and Akhtar Hussain and Duc-Minh Vu and Xiao Zhang and Van-Hai Bui},

doi = {10.1016/j.erss.2025.104474},

year  = {2026},

date = {2026-01-01},

urldate = {2026-01-01},

journal = {Energy Research & Social Science},

volume = {131},

pages = {104474},

publisher = {Elsevier},

keywords = {},

pubstate = {published},

tppubtype = {article}

}

@article{Ta2025SBRPRescheduling,

title = {The rescheduling school bus routing problem under a constraint on the number of students with negative impact},

author = {Quy Ta Dinh and Thu Huong Dang and Minh Hoang Ha and Duc Minh Vu and Tien Mai},

url = {https://doi.org/10.1080/01605682.2025.2519991},

doi = {10.1080/01605682.2025.2519991},

year  = {2025},

date = {2025-01-01},

urldate = {2025-01-01},

journal = {Journal of the Operational Research Society},

keywords = {},

pubstate = {published},

tppubtype = {article}

}

@article{DBLP:journals/eor/VuHV22,

title = {Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery},

author = {Duc Minh Vu and Mike Hewitt and Duc D. Vu},

url = {https://doi.org/10.1016/j.ejor.2022.01.029},

doi = {10.1016/J.EJOR.2022.01.029},

year  = {2022},

date = {2022-01-01},

urldate = {2022-01-01},

journal = {Eur. J. Oper. Res.},

volume = {302},

number = {3},

pages = {831–846},

keywords = {},

pubstate = {published},

tppubtype = {article}

}

@article{DBLP:journals/cor/VuKMD22,

title = {Branch-and-check approaches for the tourist trip design problem with rich constraints},

author = {Duc Minh Vu and Yannick Kergosien and Jorge E. Mendoza and Pierre Desport},

url = {https://doi.org/10.1016/j.cor.2021.105566},

doi = {10.1016/J.COR.2021.105566},

year  = {2022},

date = {2022-01-01},

urldate = {2022-01-01},

journal = {Comput. Oper. Res.},

volume = {138},

pages = {105566},

keywords = {},

pubstate = {published},

tppubtype = {article}

}

@article{DBLP:journals/transci/VuHBS20,

title = {Dynamic Discretization Discovery for Solving the Time-Dependent Traveling Salesman Problem with Time Windows},

author = {Duc Minh Vu and Mike Hewitt and Natashia Boland and Martin W. P. Savelsbergh},

url = {https://doi.org/10.1287/trsc.2019.0911},

doi = {10.1287/TRSC.2019.0911},

year  = {2020},

date = {2020-01-01},

urldate = {2020-01-01},

journal = {Transp. Sci.},

volume = {54},

number = {3},

pages = {703–720},

keywords = {},

pubstate = {published},

tppubtype = {article}

}

@article{DBLP:journals/ejtl/CrainicHTV18,

title = {Scheduled service network design with resource acquisition and management},

author = {Teodor Gabriel Crainic and Mike Hewitt and Michel Toulouse and Duc Minh Vu},

url = {https://doi.org/10.1007/s13676-017-0103-x},

doi = {10.1007/S13676-017-0103-X},

year  = {2018},

date = {2018-01-01},

urldate = {2018-01-01},

journal = {EURO J. Transp. Logist.},

volume = {7},

number = {3},

pages = {277–309},

keywords = {},

pubstate = {published},

tppubtype = {article}

}

@article{DBLP:journals/transci/CrainicHTV16,

title = {Service Network Design with Resource Constraints},

author = {Teodor Gabriel Crainic and Mike Hewitt and Michel Toulouse and Duc Minh Vu},

url = {https://doi.org/10.1287/trsc.2014.0525},

doi = {10.1287/TRSC.2014.0525},

year  = {2016},

date = {2016-01-01},

urldate = {2016-01-01},

journal = {Transp. Sci.},

volume = {50},

number = {4},

pages = {1380–1393},

keywords = {},

pubstate = {published},

tppubtype = {article}

}

@article{DBLP:journals/heuristics/VuCT13,

title = {A three-phase matheuristic for capacitated multi-commodity fixed-cost network design with design-balance constraints},

author = {Duc Minh Vu and Teodor Gabriel Crainic and Michel Toulouse},

url = {https://doi.org/10.1007/s10732-013-9225-y},

doi = {10.1007/S10732-013-9225-Y},

year  = {2013},

date = {2013-01-01},

urldate = {2013-01-01},

journal = {J. Heuristics},

volume = {19},

number = {5},

pages = {757–795},

keywords = {},

pubstate = {published},

tppubtype = {article}

}