Approximate vs. exact algorithms to solve the maximum line length problem
From MaRDI portal
Publication:2743667
DOI10.1080/02331930108844548zbMath0982.65075MaRDI 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
optimization; algorithms; numerical experiments; nonlinear programming; queueing system; gradient projection method; maximum line length; multiservice system
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
90B22: Queues and service in operations research
Cites Work