Selecting hierarchical facilities in a service-operations environment
From MaRDI portal
Publication:1873008
DOI10.1016/S0377-2217(02)00300-4zbMath1026.90022MaRDI QIDQ1873008
Vaidyanathan Jayaraman, Hasan Pirkul, Rakesh Gupta
Publication date: 19 May 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Queues and service in operations research (90B22)
Related Items (3)
A review of hierarchical facility location models ⋮ A fuzzy multi-objective programming for optimization of fire station locations through genetic algorithms ⋮ Lower and upper bounds for a two-level hierarchical location problem in computer networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hierarchical location-allocation problems: A classification scheme
- Capacitated emergency facility siting with multiple levels of backup
- A note on the knapsack problem with special ordered sets
- The Maximal Covering Location Problem with Capacities on Total Workload
- Covering-Location Models for Emergency Situations That Require Multiple Response Units
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Production, Transportation, and Distribution Planning in a Multi-Commodity Tri-Echelon System
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- A Lagrangian relaxation approach to the edge-weighted clique problem
- Hierarchical location-allocation models for congested systems
This page was built for publication: Selecting hierarchical facilities in a service-operations environment