Application placement in computer clustering in software as a service (SaaS) networks
Author
Abstract
Suggested Citation
DOI: 10.1007/s10799-016-0261-9
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Lan, Guanghui & DePuy, Gail W. & Whitehouse, Gary E., 2007. "An effective and simple heuristic for the set covering problem," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1387-1403, February.
- Mazzola, Joseph B. & Neebe, Alan W., 1999. "Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type," European Journal of Operational Research, Elsevier, vol. 115(2), pages 285-299, June.
- M Haouari & J S Chaouachi, 2002. "A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(7), pages 792-799, July.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Hsin-Pin Fu & Tsung-Sheng Chang & Hsiao-Ping Yeh & Yu-Xuan Chen, 2019. "Analysis of Factors Influencing Hospitals’ Implementation of a Green E-Procurement System Using a Cloud Model," IJERPH, MDPI, vol. 16(24), pages 1-16, December.
- Ali Amiri, 2022. "The application grouping problem in Software-as-a-Service (SaaS) networks," Information Technology and Management, Springer, vol. 23(2), pages 125-137, June.
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.- Ali Amiri, 0. "Application placement in computer clustering in software as a service (SaaS) networks," Information Technology and Management, Springer, vol. 0, pages 1-13.
- Naji-Azimi, Zahra & Toth, Paolo & Galli, Laura, 2010. "An electromagnetism metaheuristic for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 205(2), pages 290-300, September.
- Li, Shengyin & Huang, Yongxi, 2014. "Heuristic approaches for the flow-based set covering problem with deviation paths," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 72(C), pages 144-158.
- Haouari, Mohamed & Chaouachi, Jouhaina Siala, 2006. "Upper and lower bounding strategies for the generalized minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 171(2), pages 632-647, June.
- Jans, Raf & Degraeve, Zeger, 2008. "A note on a symmetrical set covering problem: The lottery problem," European Journal of Operational Research, Elsevier, vol. 186(1), pages 104-110, April.
- Correia, Isabel & Melo, Teresa & Saldanha-da-Gama, Francisco, 2012. "Comparing classical performance measures for a multi-period, two-echelon supply chain network design problem with sizing decisions," Technical Reports on Logistics of the Saarland Business School 1, Saarland University of Applied Sciences (htw saar), Saarland Business School.
- Holzapfel, Andreas & Potoczki, Tobias & Kuhn, Heinrich, 2023. "Designing the breadth and depth of distribution networks in the retail trade," International Journal of Production Economics, Elsevier, vol. 257(C).
- Vila, Didier & Martel, Alain & Beauregard, Robert, 2006. "Designing logistics networks in divergent process industries: A methodology and its application to the lumber industry," International Journal of Production Economics, Elsevier, vol. 102(2), pages 358-378, August.
- Lakmali Weerasena & Aniekan Ebiefung & Anthony Skjellum, 2022. "Design of a heuristic algorithm for the generalized multi-objective set covering problem," Computational Optimization and Applications, Springer, vol. 82(3), pages 717-751, July.
- Fabio Colombo & Roberto Cordone & Guglielmo Lulli, 2015. "A variable neighborhood search algorithm for the multimode set covering problem," Journal of Global Optimization, Springer, vol. 63(3), pages 461-480, November.
- Simin Huang & Rajan Batta & Rakesh Nagi, 2009. "Simultaneous siting and sizing of distribution centers on a plane," Annals of Operations Research, Springer, vol. 167(1), pages 157-170, March.
- Lan, Guanghui & DePuy, Gail W. & Whitehouse, Gary E., 2007. "An effective and simple heuristic for the set covering problem," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1387-1403, February.
- Giovanni Felici & Sokol Ndreca & Aldo Procacci & Benedetto Scoppola, 2016. "A-priori upper bounds for the set covering problem," Annals of Operations Research, Springer, vol. 238(1), pages 229-241, March.
- Seok, Hyesung & Nof, Shimon Y., 2014. "Dynamic coalition reformation for adaptive demand and capacity sharing," International Journal of Production Economics, Elsevier, vol. 147(PA), pages 136-146.
- 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.
- Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.
- J. E. Beasley, 2024. "An optimal algorithm for variable knockout problems," 4OR, Springer, vol. 22(4), pages 419-433, December.
- Christopher Garcia, 2016. "Winner Determination Algorithms for Combinatorial Auctions with Sub-cardinality Constraints," Computational Economics, Springer;Society for Computational Economics, vol. 47(3), pages 401-421, March.
- Bai, Yun & Hwang, Taesung & Kang, Seungmo & Ouyang, Yanfeng, 2011. "Biofuel refinery location and supply chain planning under traffic congestion," Transportation Research Part B: Methodological, Elsevier, vol. 45(1), pages 162-175, January.
- 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.
More about this item
Keywords
Application placement; Software as a service; Cloud computing; Integer programming;All these keywords.
Statistics
Access and download statisticsCorrections
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:spr:infotm:v:18:y:2017:i:2:d:10.1007_s10799-016-0261-9. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.