Linear formulations and valid inequalities for a classic location problem with congestion: a robust optimization application

DOI10.1007/s11590-019-01419-8zbMath1445.90058OpenAlexW2943467924WikidataQ127951142 ScholiaQ127951142MaRDI QIDQ2191296

Nasrin Ramshe, Amir Ahmadi-Javid

Publication date: 24 June 2020

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-019-01419-8

zbMATH Keywords

robust optimizationinteger nonlinear programmingservice systemsM/G/1, M/M/1, and M/D/1 queuesstochastic facility location models

Mathematics Subject Classification ID

Integer programming (90C10) Queues and service in operations research (90B22) Discrete location and assignment (90B80) Robustness in mathematical programming (90C17)

Related Items

Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion ⋮ Robust design of service systems with immobile servers under demand uncertainty ⋮ A portfolio optimization approach to design of congested multi‐service networks with application in community healthcare: fractional 0‐1 programming

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient solution of a class of location-allocation problems with stochastic demand and congestion
• The impact of client choice on preventive healthcare facility network design
• A review of congestion models in the location of facilities with immobile servers
• Incorporating congestion in preventive healthcare facility network design
• Solution procedures for the service system design problem
• Service system design for managing interruption risks: a backup-service risk-mitigation strategy
• Algorithms for a facility location problem with stochastic customer demand and immobile servers
• Location-allocation of multiple-server service centers with constrained queues or waiting times
• Theory and Applications of Robust Optimization
• The multiple server location problem
• A portfolio optimization approach to design of congested multi‐service networks with application in community healthcare: fractional 0‐1 programming