Convexification of queueing formulas by mixed-integer second-order cone programming: an application to a discrete location problem with congestion (Q5058005)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Convexification of queueing formulas by mixed-integer second-order cone programming: an application to a discrete location problem with congestion |
scientific article; zbMATH DE number 7625893
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convexification of queueing formulas by mixed-integer second-order cone programming: an application to a discrete location problem with congestion |
scientific article; zbMATH DE number 7625893 |
Statements
Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion (English)
0 references
1 December 2022
0 references
queues
0 references
optimization
0 references
integer programming
0 references
networks
0 references
service system design
0 references
capacity planning
0 references
stochastic facility location
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8151592016220093
0 references
0.7942327857017517
0 references
0.7685796618461609
0 references
