MENU-OKF
Network and discrete location. Models, algorithms, and applications (to appear) The second edition focuses on real-world extensions of the basic models used in locating facilities, including production and distribution systems, location-inventory models, and defender-interdictor problems. A unique taxonomy of location problems and models is also presented. Featuring examples using the author’s own software -- SITATION, MOD-DIST, and MENU-OKF -- as well as Microsoft Office Excel, the book provides: -- A theoretical and applied perspective on location models and algorithms -- An intuitive presentation of the uses and limits of modeling techniques -- An introduction to integrated location-inventory modeling and defender-interdictor models for the design of reliable facility location systems -- A full range of exercises to equip readers with an understanding of the basic facility location model types
Keywords for this software
References in zbMATH (referenced in 256 articles )
Showing results 1 to 20 of 256.
Sorted by year (- Gaar, Elisabeth; Sinnl, Markus: A scaleable projection-based branch-and-cut algorithm for the (p)-center problem (2022)
- Ghiyasvand, Mehdi; Keshtkar, Iman: Solving the absolute 1-center problem in the quickest path case (2022)
- Haywood, Adam B.; Lunday, Brian J.; Robbins, Matthew J.; Pachter, Meir N.: The weighted intruder path covering problem (2022)
- Millstein, Mitchell A.; Bilir, Canser; Campbell, James F.: The effect of optimizing warehouse locations on omnichannel designs (2022)
- Amiri-Aref, Mehdi; Shiripour, Saber; Ruiz-Hernández, Diego: Exact and approximate heuristics for the rectilinear Weber location problem with a line barrier (2021)
- Hasanzadeh, Mehran; Alizadeh, Behrooz; Baroughi, Fahimeh: The cardinality constrained inverse center location problems on tree networks with edge length augmentation (2021)
- Imanparast, Mahdi; Kiani, Vahid: A practical heuristic for maximum coverage in large-scale continuous location problem (2021)
- Kalczynski, Pawel; Drezner, Zvi: The obnoxious facilities planar (p)-median problem (2021)
- Li, Yongzhen; Lin, Yuqin; Shu, Jia: Location and two-echelon inventory network design with economies and diseconomies of scale in facility operating costs (2021)
- Matos, Telmo; Oliveira, Óscar; Gamboa, Dorabela: RAMP algorithms for the capacitated facility location problem (2021)
- Moazeni, Somayeh; Collado, Ricardo A.: Resource allocation for contingency planning: an inexact proximal bundle method for stochastic optimization (2021)
- Ni, Wenjun; Shu, Jia; Song, Miao; Xu, Dachuan; Zhang, Kaike: A branch-and-price algorithm for facility location with general facility cost functions (2021)
- Ben Mohamed, Imen; Klibi, Walid; Vanderbeck, François: Designing a two-echelon distribution network under demand uncertainty (2020)
- Bhuiyan, Tanveer Hossain; Medal, Hugh R.; Harun, Sarah: A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption (2020)
- Calvete, Herminia I.; Galé, Carmen; Iranzo, José A.; Camacho-Vallejo, José-Fernando; Casas-Ramírez, Martha-Selene: A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences (2020)
- Demange, Marc; Gabrel, Virginie; Haddad, Marcel A.; Murat, Cécile: A robust (p)-center problem under pressure to locate shelters in wildfire context (2020)
- Du, Bo; Zhou, Hong; Leus, Roel: A two-stage robust model for a reliable (p)-center facility location problem (2020)
- Gourtani, Arash; Nguyen, Tri-Dung; Xu, Huifu: A distributionally robust optimization approach for two-stage facility location problems (2020)
- Jagtenberg, C. J.; Mason, A. J.: Improving fairness in ambulance planning by time sharing (2020)
- Kramer, Raphael; Iori, Manuel; Vidal, Thibaut: Mathematical models and search algorithms for the capacitated (p)-center problem (2020)