Author of the publication

A discrete competitive facility location model with proportional and binary rules sequentially applied.

, , , and . Optim. Lett., 17 (4): 867-877 (May 2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Estimating actual distances by norm functions: a comparison between the lk, p, theta-norm and the lb1, b2, theta-norm and a study about the selection of the data set., , and . Comput. Oper. Res., 29 (6): 609-623 (2002)Ranking-based discrete optimization algorithm for asymmetric competitive facility location., , , and . GECCO (Companion), page 149-150. ACM, (2019)On the sum-max bicriterion path problem., and . Comput. Oper. Res., 25 (12): 1043-1054 (1998)GASUB: finding global optima to discrete location problems by a genetic-like algorithm., , , , and . J. Glob. Optim., 38 (2): 249-264 (2007)Finding multiple global optima for unconstrained discrete location problems., , , , and . Optim. Methods Softw., 26 (2): 207-224 (2011)Parallelization of an Algorithm for Finding Facility Locations for an Entering Firm Under Delivered Pricing., , , , and . PARCO, volume 33 of John von Neumann Institute for Computing Series, page 269-276. Central Institute for Applied Mathematics, Jülich, Germany, (2005)New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior., , , and . Comput. Oper. Res., (2017)Sequential customers' decisions in facility location with comparison-shopping., , , , and . Comput. Oper. Res., (January 2024)A continuous location model for siting a non-noxious undesirable facility within a geographical region., , and . Eur. J. Oper. Res., 121 (2): 259-274 (2000)Improving solution of discrete competitive facility location problems., , , and . Optim. Lett., 11 (2): 259-270 (2017)