Fetching the paper…
Reading the bibliography…
In this paper, we study a facility location problem within a competitive market context, where customer demand is predicted by a random utility choice model.
Croes GA (1958) A method for solving traveling-salesman problems. Operations Research 6(6):791–812
1958
Earlier work this paper cites.
Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulation of traveling salesman problems. J. ACM 7(4):326–329
1960
Earlier work this paper cites.
Ben-Akiva M (1973) The structure of travel demand models . Ph.D. thesis, MIT
1973
Earlier work this paper cites.
Or I (1976) Traveling Salesman-Type Combinatorial Problems and their Relation to the Logistics of Regional Blood Banking . Ph.D. thesis, Evanston, IL
1976
Earlier work this paper cites.
McFadden D (1978) Modeling the choice of residential location. Spatial Interaction Theory and Residential Location , 75–96 (Amsterdam: North-Holland)
1978
Earlier work this paper cites.
Nemhauser GL, Wolsey LA (1981) Maximizing submodular set functions: formulations and analysis of algorithms. North-Holland Mathematics Studies , volume 59, 279–301 (Elsevier)
1981
Earlier work this paper cites.
Ben-Akiva M, Lerman SR (1985) Discrete Choice Analysis: Theory and Application to Travel Demand (MIT Press, Cambridge, Massachusetts)
1985
Earlier work this paper cites.
Duran MA, Grossmann IE (1986) An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Mathematical Programming 36:307–339
1986
Earlier work this paper cites.
Golden BL, Levy L, Vohra R (1987) The orienteering problem. Naval Research Logistics (NRL) 34(3):307–318
1987
Earlier work this paper cites.
Li HL (1994) A global approach for general 0–1 fractional programming. European Journal of Operational Research 73(3):590–596
1994
Earlier work this paper cites.
Fischetti M, González JJS, Toth P (1998) Solving the orienteering problem through branch-and-cut. INFORMS Journal on Computing 10(2):133–148
1998
Earlier work this paper cites.
Vovsha P, Bekhor S (1998) Link-nested logit model of route choice Overcoming route overlapping problem. Transportation Research Record 1645:133–142
1998
Earlier work this paper cites.
Ben-Akiva M, Bierlaire M (1999) Discrete Choice Methods and their Applications to Short Term Travel Decisions , 5–33 (Boston, MA: Springer US)
1999
Earlier work this paper cites.
McFadden D, Train K (2000) Mixed MNL models for discrete response. Journal of applied Econometrics 447–470
2000
Earlier work this paper cites.
McFadden D (2001) Economic choices. American Economic Review 351–378
2001
Earlier work this paper cites.
Benati S, Hansen P (2002) The maximum capture problem with random utilities: Problem formulation and algorithms. European Journal of Operational Research 143(3):518–530
2002
Earlier work this paper cites.
Tawarmalani M, Ahmed S, Sahinidis N (2002) Global optimization of 0-1 hyperbolic programs. Journal of Global Optimization 24:385–416
2002
Earlier work this paper cites.
Train K (2003) Discrete Choice Methods with Simulation (Cambridge University Press)
2003
Earlier work this paper cites.
Feillet D, Dejax P, Gendreau M (2005) Traveling salesman problems with profits. Transportation Science 39(2):188–205
2005
Cited alongside, same era.
Calinescu G, Chekuri C, Pál M, Vondrák J (2007) Maximizing a submodular set function subject to a matroid constraint. International Conference on Integer Programming and Combinatorial Optimization , 182–196 (Springer)
2007
Cited alongside, same era.
Laporte G, Martín IR (2007) Locating a cycle in a transportation or a telecommunications network. Networks 50(1):92–108
2007
Cited alongside, same era.
Bonami P, Biegler LT, Conn AR, Cornuéjols G, Grossmann IE, Laird CD, Lee J, Lodi A, Margot F, Sawaya N, et al. (2008) An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optimization 5(2):186–204
2008
Cited alongside, same era.
Fosgerau M, Bierlaire M (2009) Discrete choice models with multiplicative error terms. Transportation Research Part B 43(5):494–505
Archetti C, Carrabs F, Cerulli R (2018) The set orienteering problem. European Journal of Operational Research 267(1):264–272
2018
Later among the works it cites.
Şen A, Atamtürk A, Kaminsky P (2018) A conic integer programming approach to constrained assortment optimization under the mixed multinomial logit model. Operations Research 66(4):994–1003
2018
Later among the works it cites.
Dolinskaya I, Shi ZE, Smilowitz K (2018) Adaptive orienteering problem with stochastic travel times. Transportation Research Part E: Logistics and Transportation Review 109:1–19
2018
Later among the works it cites.
Freeman NK, Keskin BB, İbrahim Çapar (2018) Attractive orienteering problem with proximity and timing interactions. European Journal of Operational Research 266(1):354–370
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2009
Cited alongside, same era.
Haase K (2009) Discrete location planning, URL http://hdl.handle.net/2123/19420
2009
Cited alongside, same era.
Vansteenwegen P, Souffriau W, Oudheusden DV (2011) The orienteering problem: A survey. European Journal of Operational Research 209(1):1–10
2011
Cited alongside, same era.
Zhang Y, Berman O, Verter V (2012) The impact of client choice on preventive healthcare facility network design. OR Spectrum 34:349–370
2012
Cited alongside, same era.
Angelelli E, Archetti C, Vindigni M (2014) The clustered orienteering problem. European Journal of Operational Research 238(2):404–414
2014
Cited alongside, same era.
Haase K, Müller S (2014) A comparison of linear reformulations for multinomial logit choice probabilities in facility location models. European Journal of Operational Research 232(3):689–691
2014
Cited alongside, same era.
Gunawan A, Lau HC, Lu K (2015) An iterated local search algorithm for solving the orienteering problem with time windows. Evolutionary Computation in Combinatorial Optimization , 61–73 (Cham: Springer International Publishing)
2015
Cited alongside, same era.
Freire A, Moreno E, Yushimito W (2016) A branch-and-bound algorithm for the maximum capture problem with random utilities. European Journal of Operational Research 252(1):204–212
2016
Cited alongside, same era.
2018
Later among the works it cites.
Ljubić I, Moreno E (2018) Outer approximation and submodular cuts for maximum capture facility location problems with random utilities. European Journal of Operational Research 266(1):46–56
2018
Later among the works it cites.
Tsiogkas N, Lane DM (2018) Dcop: Dubins correlated orienteering problem optimizing sensing missions of a nonholonomic vehicle under budget constraints. IEEE Robotics and Automation Letters 3(4):2926–2933
2018
Later among the works it cites.
Mehmanchi E, Gómez A, Prokopyev O (2019) Fractional 0–1 programs: links between mixed-integer linear and conic quadratic formulations. Journal of Global Optimization 75:273–339
2019
Later among the works it cites.
Pěnička R, Faigl J, Saska M (2019) Physical orienteering problem for unmanned aerial vehicle data collection planning in environments with obstacles. IEEE Robotics and Automation Letters 4(3):3005–3012
2019
Later among the works it cites.
Mai T, Lodi A (2020) A multicut outer-approximation approach for competitive facility location under random utilities. European Journal of Operational Research 284(3):874–881
2020
Later among the works it cites.
Mehmanchi E, Gillen CP, Gómez A, Prokopyev OA (2020) On robust fractional 0-1 programming. INFORMS Journal on Optimization 2(2):96–133
2020
Later among the works it cites.
Dam TT, Ta TA, Mai T (2022) Submodularity and local search approaches for maximum capture problems under generalized extreme value models. European Journal of Operational Research 300(3):953–965
2022
Later among the works it cites.
Meyer F, Glock K (2022) Kinematic orienteering problem with time-optimal trajectories for multirotor uavs. IEEE Robotics and Automation Letters 7(4):11402–11409
2022
Later among the works it cites.
Nguyen MA, Luong H, Hà M, Ha-Bang B (2022) An efficient branch-and-cut algorithm for the parallel drone scheduling traveling salesman problem. 4OR 21:609–637
2022
Later among the works it cites.
Yu Q, Cheng C, Zhu N (2022) Robust team orienteering problem with decreasing profits. INFORMS Journal on Computing 34(6):3215–3233
2022
Later among the works it cites.
Dam TT, Ta TA, Mai T (2023) Robust maximum capture facility location under random utility maximization models. European Journal of Operational Research 310(3):1128–1150
2023
Later among the works it cites.
Lamontagne S, Carvalho M, Frejinger E, Gendron B, Anjos MF, Atallah R (2023) Optimising electric vehicle charging station placement using advanced discrete choice models. INFORMS Journal on Computing 35(5):1195–1213
2023
Later among the works it cites.