Approximate vs. exact algorithms to solve the maximum line length problem
type: Item
instance of: scholarly article
title: Approximate vs. exact algorithms to solve the maximum line length problem
zbMATH Open document ID: 0982.65075
DOI: 10.1080/02331930108844548
author: Paolo Pellizzari
author: Bruno Viscolani
published in: Optimization
publication date: 2001-11-06T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 1652420
zbMATH Keywords: optimization
zbMATH Keywords: queueing system
zbMATH Keywords: nonlinear programming
zbMATH Keywords: gradient projection method
zbMATH Keywords: maximum line length
zbMATH Keywords: multiservice system
zbMATH Keywords: numerical experiments
zbMATH Keywords: algorithms
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1080/02331930108844548
OpenAlex ID: W1973896932
cites work: A Classified Bibliography of Research on Optimal Design and Control of Queues
cites work: Optimal design of a multiservice system: The line-penalty problem
cites work: Q3994799
cites work: Q3806522
cites work: Q3713481
cites work: Q5538132
reviewed by: Hang Lau
description: scientific article; zbMATH DE number 1652420