IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v114y1999i1p127-140.html
   My bibliography  Save this article

Exact solution methods for uncapacitated location problems with convex transportation costs

Author

Listed:
  • Holmberg, Kaj

Abstract

No abstract is available for this item.

Suggested Citation

  • Holmberg, Kaj, 1999. "Exact solution methods for uncapacitated location problems with convex transportation costs," European Journal of Operational Research, Elsevier, vol. 114(1), pages 127-140, April.
    • Handle: RePEc:eee:ejores:v:114:y:1999:i:1:p:127-140
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(98)00039-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Donald Erlenkotter, 1978. "A Dual-Based Procedure for Uncapacitated Facility Location," Operations Research, INFORMS, vol. 26(6), pages 992-1009, December.
    2. Beasley, J. E., 1993. "Lagrangean heuristics for location problems," European Journal of Operational Research, Elsevier, vol. 65(3), pages 383-399, March.
    3. Dale McDaniel & Mike Devine, 1977. "A Modified Benders' Partitioning Algorithm for Mixed Integer Programming," Management Science, INFORMS, vol. 24(3), pages 312-319, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Rodriguez-Martin, Inmaculada & Salazar-Gonzalez, Juan Jose, 2008. "Solving a capacitated hub location problem," European Journal of Operational Research, Elsevier, vol. 184(2), pages 468-479, January.
    2. Hadi Bidhandi, 2006. "A new approach based on the surrogating method in the project time compression problems," Annals of Operations Research, Springer, vol. 143(1), pages 237-250, March.
    3. Dezhi Zhang & Shuxin Yang & Shuangyan Li & Jiajun Fan & Bin Ji, 2020. "Integrated Optimization of the Location–Inventory Problem of Maintenance Component Distribution for High-Speed Railway Operations," Sustainability, MDPI, vol. 12(13), pages 1-25, July.
    4. Christensen, Tue Rauff Lind & Klose, Andreas, 2021. "A fast exact method for the capacitated facility location problem with differentiable convex production costs," European Journal of Operational Research, Elsevier, vol. 292(3), pages 855-868.
    5. Marta Sofia R. Monteiro & Dalila B. M. M. Fontes & Fernando A. C. C. Fontes, 2009. "Restructuring Facility Networks under Economy of Scales," FEP Working Papers 324, Universidade do Porto, Faculdade de Economia do Porto.
    6. Mina Husseinzadeh Kashan & Ali Husseinzadeh Kashan & Nasim Nahavandi, 2013. "A novel differential evolution algorithm for binary optimization," Computational Optimization and Applications, Springer, vol. 55(2), pages 481-513, June.
    7. Zhao, Laijun & Zhao, Yue & Hu, Qingmi & Li, Huiyong & Stoeter, Johan, 2018. "Evaluation of consolidation center cargo capacity and loctions for China railway express," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 117(C), pages 58-81.
    8. Correia, Isabel & Gouveia, Luís & Saldanha-da-Gama, Francisco, 2010. "Discretized formulations for capacitated location problems with modular distribution costs," European Journal of Operational Research, Elsevier, vol. 204(2), pages 237-244, July.
    9. Ioannis Avgerinos & Ioannis Mourtos & Georgios Zois, 2022. "Multi-type facility location in printing and parcel delivery services," Annals of Operations Research, Springer, vol. 309(1), pages 365-393, February.
    10. Erdem Eskigun & Reha Uzsoy & Paul V. Preckel & George Beaujon & Subramanian Krishnan & Jeffrey D. Tew, 2007. "Outbound supply chain network design with mode selection and lead time considerations," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(3), pages 282-300, April.
    11. Adil Baykasoğlu & Fehmi Burcin Ozsoydan & M. Emre Senol, 2020. "Weighted superposition attraction algorithm for binary optimization problems," Operational Research, Springer, vol. 20(4), pages 2555-2581, December.
    12. Torabi, S.A. & Hassini, E. & Jeihoonian, M., 2015. "Fulfillment source allocation, inventory transshipment, and customer order transfer in e-tailing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 79(C), pages 128-144.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Monabbati, Ehsan & Kakhki, Hossein Taghizadeh, 2015. "On a class of subadditive duals for the uncapacitated facility location problem," Applied Mathematics and Computation, Elsevier, vol. 251(C), pages 118-131.
    2. Drexl, Andreas & Klose, Andreas, 2001. "Facility location models for distribution system design," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 546, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    3. Holmberg, Kaj & Ronnqvist, Mikael & Yuan, Di, 1999. "An exact algorithm for the capacitated facility location problems with single sourcing," European Journal of Operational Research, Elsevier, vol. 113(3), pages 544-559, March.
    4. Ronnqvist, Mikael & Tragantalerngsak, Suda & Holt, John, 1999. "A repeated matching heuristic for the single-source capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 116(1), pages 51-68, July.
    5. Resende, Mauricio G.C. & Werneck, Renato F., 2006. "A hybrid multistart heuristic for the uncapacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 174(1), pages 54-68, October.
    6. Cortinhal, Maria Joao & Captivo, Maria Eugenia, 2003. "Upper and lower bounds for the single source capacitated location problem," European Journal of Operational Research, Elsevier, vol. 151(2), pages 333-351, December.
    7. Goldengorin, Boris, 2001. "Solving the simple plant location problem using a data correcting approach," Research Report 01A53, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    8. Holmberg, Kaj & Ling, Jonas, 1997. "A Lagrangean heuristic for the facility location problem with staircase costs," European Journal of Operational Research, Elsevier, vol. 97(1), pages 63-74, February.
    9. Pierre Hansen & Jack Brimberg & Dragan Urošević & Nenad Mladenović, 2007. "Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem," INFORMS Journal on Computing, INFORMS, vol. 19(4), pages 552-564, November.
    10. R. K. Ahuja & J. B. Orlin & S. Pallottino & M. P. Scaparra & M. G. Scutellà, 2004. "A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem," Management Science, INFORMS, vol. 50(6), pages 749-760, June.
    11. Mladenovic, Nenad & Brimberg, Jack & Hansen, Pierre & Moreno-Perez, Jose A., 2007. "The p-median problem: A survey of metaheuristic approaches," European Journal of Operational Research, Elsevier, vol. 179(3), pages 927-939, June.
    12. Hinojosa, Y. & Puerto, J. & Fernandez, F. R., 2000. "A multiperiod two-echelon multicommodity capacitated plant location problem," European Journal of Operational Research, Elsevier, vol. 123(2), pages 271-291, June.
    13. H K Smith & G Laporte & P R Harper, 2009. "Locational analysis: highlights of growth to maturity," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 140-148, May.
    14. Klose, Andreas & Drexl, Andreas, 2005. "Facility location models for distribution system design," European Journal of Operational Research, Elsevier, vol. 162(1), pages 4-29, April.
    15. Dupont, Lionel, 2008. "Branch and bound algorithm for a facility location problem with concave site dependent costs," International Journal of Production Economics, Elsevier, vol. 112(1), pages 245-254, March.
    16. Klose, Andreas, 2000. "A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 126(2), pages 408-421, October.
    17. P N Ram Kumar & T T Narendran, 2011. "On the usage of Lagrangean Relaxation for the convoy movement problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(4), pages 722-728, April.
    18. Letchford, Adam N. & Miller, Sebastian J., 2014. "An aggressive reduction scheme for the simple plant location problem," European Journal of Operational Research, Elsevier, vol. 234(3), pages 674-682.
    19. Goldengorin, Boris & Ghosh, Diptesh & Sierksma, Gerard, 2001. "Branch and peg algorithms for the simple plant location problem," Research Report 01A14, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    20. Canovas, Lazaro & Garcia, Sergio & Marin, Alfredo, 2007. "Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique," European Journal of Operational Research, Elsevier, vol. 179(3), pages 990-1007, June.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:114:y:1999:i:1:p:127-140. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.