Queueing-location problems on the plane
From MaRDI portal
Recommendations
Cited in
(16)- On solving the sum-of-ratios problem
- A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension
- Solving sum-of-ratios fractional programs using efficient points
- A practicable branch and bound algorithm for sum of linear ratios problem
- Controllable production rates in a family production context
- Trajectory Analysis of the Stochastic Queue Median in a Plane with Rectilinear Distances
- scientific article; zbMATH DE number 4112361 (Why is no real title available?)
- A fifth bibliography of fractional programming*
- scientific article; zbMATH DE number 1783860 (Why is no real title available?)
- The Weiszfeld Algorithm: Proof, Amendments, and Extensions
- On queueing-inventory-location problems
- A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation
- A center location problem with congestion
- Light traffic heuristic for an M/G/1 queue with limited inventory
- Regional division and reduction algorithm for minimizing the sum of linear fractional functions
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
This page was built for publication: Queueing-location problems on the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3204321)