On the discrete-time system with server breakdowns: Computational algorithm and optimization algorithm (Q426397): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C50
@@ Property / Mathematics Subject Classification ID: 65C50 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+K25
@@ Property / Mathematics Subject Classification ID: 60K25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6045187
@@ Property / zbMATH DE Number: 6045187 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+breakdowns
@@ Property / zbMATH Keywords: breakdowns / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+quasi-Newton method
@@ Property / zbMATH Keywords: quasi-Newton method / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+numerical examples
@@ Property / zbMATH Keywords: numerical examples / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+discrete-time Geo/Geo/1 queueing system
@@ Property / zbMATH Keywords: discrete-time Geo/Geo/1 queueing system / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+quasi-birth-death process
@@ Property / zbMATH Keywords: quasi-birth-death process / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+search algorithm
@@ Property / zbMATH Keywords: search algorithm / rank @@
+Normal rank

Revision as of 21:52, 29 June 2023