Approximate vs. exact algorithms to solve the maximum line length problem (Q2743667): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A Classified Bibliography of Research on Optimal Design and Control of Queues / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal design of a multiservice system: The line-penalty problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3994799 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3806522 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3713481 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5538132 / rank | |||
Normal rank | |||
Latest revision as of 20:08, 3 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate vs. exact algorithms to solve the maximum line length problem |
scientific article |
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
