Simultaneous location-allocation of facilities and servers. a generalized heuristic
From MaRDI portal
Publication:3760269
Recommendations
Cites work
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An Analysis of Private and Public Sector Location Models
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Reducibility of minimax to minisum 0-1 programming problems
Cited in
(9)- Solving nonlinear multiple-facility network location problems
- Location of multiple-server congestible facilities for maximizing expected demand, when services are non-essential
- Location-allocation on congested networks
- The multiple server location problem
- Product location, allocation and server home base location for an order picking line with multiple servers.
- The multiple server center location problem
- scientific article; zbMATH DE number 3896624 (Why is no real title available?)
- Location-allocation of multiple-server service centers with constrained queues or waiting times
- scientific article; zbMATH DE number 4100911 (Why is no real title available?)
This page was built for publication: Simultaneous location-allocation of facilities and servers. a generalized heuristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3760269)