References
- AgarMCSalhiSLagrangean heuristics applied to a variety of large capacitated plant location problemsJ Opl Res Soc1998491072108410.1057/palgrave.jors.2600621
- AkincUKhumawalaBMAn efficient branch and bound algorithm for the capacitated warehouse location problemMngt Sci19772358559410.1287/mnsc.23.6.585
- BarahonaFChudakFANear-optimal solutions to large-scale facility location problemsDiscrete Opt20052355010.1016/j.disopt.2003.03.001
- BeasleyJEAn algorithm for solving large capacitated warehouse location problemsEur J Opl Res19883331432510.1016/0377-2217(88)90175-0
- BeasleyJEOR-Library: Distributing test problems by electronic mailJ Opl Res Soc1990411069107210.1057/jors.1990.166
- BeasleyJELagrangean heuristics for location problemsEur J Opl Res19936538339910.1016/0377-2217(93)90118-7
- BelyaevaLVZhurbenkoNGShorNZOn a method of solving a class of dynamic distributive problemsEcon Math Method (in Russian)197814137146
- BornsteinCTAzlanHBThe use of reduction tests and simulated annealing for the capacitated plant location problemLocation Sci19986678110.1016/S0966-8349(98)00062-X
- ChaudhrySForstFZydiakJVendor selection with price breaksEur J Opl Res199370526610.1016/0377-2217(93)90232-C
- ChristofidesNBeasleyJEExtensions to a Lagrangean relaxation approach for the capacitated warehouse location problemEur J Opl Res198312192810.1016/0377-2217(83)90179-0
- CornuejolsGSridharanRThizyJMA comparison of heuristics and relaxations for the capacitated plant location problemEur J Opl Res19915028029710.1016/0377-2217(91)90261-S
- Goossens DR, Maas AJT, Spieksma FCR and van der Klundert JJ (2004). Exact algorithms for procurement problems under a total quantity discount structure. Technical Report OR 0452, Faculty of Economics and Applied Economics, K.U. Leuven.
- HolmbergKSolving the staircase cost facility location problem with decomposition and piecewise linearizationEur J Opl Res199475416110.1016/0377-2217(94)90184-8
- HolmbergKLingJA Lagrangean heuristic for the facility location problem with staircase costsEur J Opl Res199797637410.1016/S0377-2217(96)00058-6
- KhumawalaBMAn efficient branch and bound algorithm for the warehouse location problemMngt Sci1972B1871873110.1287/mnsc.18.12.B718
- KloseAGörtzSA branch-and-price algorithm for the capacitated facility location problemEur J Opl Res20071791109112510.1016/j.ejor.2005.03.078
- Kochetov Yu and Ivanenko D (2003). Computationally difficult instances for the uncapacitated facility location problem. In: T. Ibaraki et al (eds). Proceedings of the Fifth Metaheuristics International Conference (MIC2003), Kyoto; Japan.
- KörkelMOn the exact solution of large-scale simple plant location problemsEur J Opl Res19893915717310.1016/0377-2217(89)90189-6
- Krarup J and Bilde O (1977). Plant location, set covering and economic lot size: An O(mn)—algorithm for structured problems. In: Numerische Methoden bei Optimierungsaufgaben, Band 3 (Tagung, Oberwolfach, 1976). Birkhäuser: Basel, pp 155–180. Internat Ser Numer Math, Vol. 36.
- LoboMSFazelMBoydSPortfolio optimization with linear and fixed transaction costsAnn Opl Res2007152376394
- MartelloSTothPKnapsack Problems. Algorithms and Computer Implementations1990
- MunsonCLRosenblattMJTheories and realities of quantity discounts: An exploratory studyProd Opl Mngt1998735236910.1111/j.1937-5956.1998.tb00129.x
- SadrianAYoonYA procurement decision support system in business volume discount environmentsOpns Res199442142310.1287/opre.42.1.14
- SheraliHDChoiGAnsariZLimited memory space dilation and reduction algorithmsComput Opt Appl200119557710.1023/A:1011272319638
- ShorNZUtilization of the operation of space dilation in the minimization of convex functionsCybern Syst Anal1970671510.1007/BF02341816
- ShorNZNondifferentiable optimization and polynomial problemsNonconvex Optimization and Its Applications, Vol 241998
- ShorNZZhurbenkoNGA minimization method using the operation of extension of the space in the direction of the difference of two successive gradientsCybernetics1971745045910.1007/BF01070454
- ShorNZStetsyukPILagrangian bounds in multiextremal polynomial and discrete optimization problemsJ Glob Optim20022314110.1023/A:1014004625997
- ToddMJThe symmetric rank-one quasi-Newton method is a space-dilation subgradient algorithmOpl Res Lett1986521721910.1016/0167-6377(86)90010-6
- WuLYZhangXSZhangJLCapacitated facility location problem with general setup costComput Opl Res2006331226124110.1016/j.cor.2004.09.012