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

DOI10.1080/02331930108844548MaRDI QIDQ2743667zbMATH OpenOpenAlexFDO

Authors Paolo Pellizzari, Bruno Viscolani

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

algorithmsgradient projection methodmaximum line lengthmultiservice systemnonlinear programmingnumerical experimentsoptimizationqueueing system

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1357935
• Optimal design of a multiservice system: The line-penalty problem
• An optimization problem in queueing theory and a numerical solution method
• scientific article; zbMATH DE number 4152164
• scientific article; zbMATH DE number 1264429

Cites work

• A Classified Bibliography of Research on Optimal Design and Control of Queues
• scientific article; zbMATH DE number 3942888 (Why is no real title available?)
• scientific article; zbMATH DE number 4076264 (Why is no real title available?)
• scientific article; zbMATH DE number 41891 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• Optimal design of a multiservice system: The line-penalty problem

Cited in

(1)

• scientific article; zbMATH DE number 1357935 (Why is no real title available?)

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

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