Approximate vs. exact algorithms to solve the maximum line length problem

DOI10.1080/02331930108844548zbMath0982.65075OpenAlexW1973896932MaRDI QIDQ2743667

Bruno Viscolani, Paolo Pellizzari

Publication date: 6 November 2001

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930108844548

zbMATH Keywords

optimizationalgorithmsnumerical experimentsnonlinear programmingqueueing systemgradient projection methodmaximum line lengthmultiservice system

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Queues and service in operations research (90B22)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal design of a multiservice system: The line-penalty problem
• A Classified Bibliography of Research on Optimal Design and Control of Queues

This page was built for publication: Approximate vs. exact algorithms to solve the maximum line length problem