Approximate vs. exact algorithms to solve the maximum line length problem (Q2743667)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1652420
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate vs. exact algorithms to solve the maximum line length problem |
scientific article; zbMATH DE number 1652420 |
Statements
Approximate vs. exact algorithms to solve the maximum line length problem (English)
0 references
6 November 2001
0 references
optimization
0 references
queueing system
0 references
nonlinear programming
0 references
gradient projection method
0 references
maximum line length
0 references
multiservice system
0 references
numerical experiments
0 references
algorithms
0 references
0.7265075445175171
0 references
0.726397693157196
0 references
