scientific article; zbMATH DE number 1357935

zbMATH Open0935.90012MaRDI QIDQ4700728FDOQ4700728

Authors: Annamaria Sorato, Bruno Viscolani 

Publication date: 14 May 2000

Title of this publication is not available (Why is that?)

Recommendations

• Optimal design of a multiservice system: The line-penalty problem
• Publication:3481462
• Linear programming model for the optimal control of a queueing network
• Approximate vs. exact algorithms to solve the maximum line length problem
• scientific article; zbMATH DE number 3924482

zbMATH Keywords

optimizationnonlinear programmingqueueing systemresource allocation

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Nonlinear programming (90C30) Queueing theory (aspects of probability theory) (60K25)

Cited In (5)

• Title not available (Why is that?)
• Approximate vs. exact algorithms to solve the maximum line length problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Estimating the size of the calling population in finite-source election queues by bilinear programming techniques

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4700728)