37
Views
8
CrossRef citations to date
0
Altmetric
Theoretical Paper

The maximum return-on-investment plant location problem with market share

, , , &
Pages 399-406 | Received 01 Jan 2005, Accepted 01 Aug 2006, Published online: 21 Dec 2017

References

  • AryaVLocal search heuristics for k-median and facility location problemsProceedings of the Thirty-Third Annual Symposium on Theory of Computing20012129
  • BalinskiMInteger programming: Methods, uses, computationMngt Sci19651225431310.1287/mnsc.12.3.253
  • BrimbergJReVelleCA bi-objective plant location problem: Cost vs. demand servedLocation Sci1998612113510.1016/S0966-8349(98)00055-2
  • BrimbergJReVelleCThe maximum return-on-investment plant location problemJ Opl Res Soc20005172973510.1057/palgrave.jors.2600943
  • DaskinMNetwork and Discrete Location: Models, Algorithms and Applications1995
  • DinkelbachWOn nonlinear fractional programmingMngt Sci19671349249810.1287/mnsc.13.7.492
  • FeldmanELehrerFARayTLWarehouse location under continuous economies of scaleMngt Sci19661267068410.1287/mnsc.12.9.670
  • Francis RL, McGinnis Jr. LF and White JA (1992). Facility Layout and Location: An Analytical Approach, 2nd edition, International Series in Industrial and Systems Engineering. Prentice Hall: Englewood Cliffs, NJ.
  • GhoshDNeighborhood search heuristics for the uncapacitated facility location problemEur J Opl Res200315015016210.1016/S0377-2217(02)00504-0
  • GloverFTabu search. Part IORSA J Comput1989119020610.1287/ijoc.1.3.190
  • GloverFTabu search. Part IIORSA J Comput1990243210.1287/ijoc.2.1.4
  • GloverFLagunaMTabu Search1997
  • Hansen P, Brimberg J, Urosevic D and Mladenović N (2003). Primal–dual Variable Neighborhood Search for Bounded Heuristic and Exact Solution of the Simple Plant Location Problem. GERAD Report G-2003-64, University of Montreal.
  • HansenPMladenovićNVariable neighborhood search for the p-medianLocation Sci1997520722610.1016/S0966-8349(98)00030-8
  • HansenPMladenovićNVariable neighborhood search: Principles and applicationsEur J Opl Res200113044946710.1016/S0377-2217(00)00100-4
  • HansenPMladenovićNVariable neighborhood searchHandbook of Metaheuristics2003145184
  • KrarupJPruzanPMThe simple plant location problem: Survey and synthesisEur J Opl Res198312368110.1016/0377-2217(83)90181-9
  • KuehnAAHamburgerMJA heuristic program for locating warehousesMngt Sci1963964366610.1287/mnsc.9.4.643
  • LabbéMLouveauxFVLocation problemAnnotated Bibliographies in Combinatorial Optimization1997264271
  • LabbéMPeetersDThisseJFLocation on networksHandbook of Operations Research and Management Science: Network Routing1995551624
  • ManneASPlant location under economies-of-scale-decentralization and computationMngt Sci19641121323510.1287/mnsc.11.2.213
  • MirchandaniPBFrancisRLDiscrete Location Theory1990
  • MladenovićNHansenPVariable neighborhood searchComput Opns Res1997241097110010.1016/S0305-0548(97)00031-2
  • MladenovićNLabbéMHansenPSolving the p-center problem with tabu search and variable neighborhood searchNetworks200342486410.1002/net.10081
  • MladenovićNMoreno-PerezJAMoreno-VegaJA chain-interchange heuristic methodYugoslav J Opns Res199664154
  • MyungVSKimHTchaDA bi-objective uncapacitated facility location problemEur J Opl Res199710060861610.1016/S0377-2217(96)00168-3
  • ReVelleCLaporteGThe plant location problem: New models and research prospectsOpns Res19964486487410.1287/opre.44.6.864
  • StollsteimerJFA working model for plant numbers and locationsJ Farm Econom19634563164510.2307/1235442
  • TeitzMBBartPHeuristic methods for estimating the generalized vertex median of a weighted graphOpns Res19681695596110.1287/opre.16.5.955

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.