Solving covering problems and the uncapacitated plant location problem on trees (Q1838422): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4773298 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Dual-Based Procedure for Uncapacitated Facility Location / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4194994 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Totally-Balanced and Greedy Matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3858032 / rank | |||
Normal rank | |||
Latest revision as of 17:30, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving covering problems and the uncapacitated plant location problem on trees |
scientific article |
Statements
Solving covering problems and the uncapacitated plant location problem on trees (English)
0 references
1983
0 references
totally-balanced matrix
0 references
tree network
0 references
location problems
0 references
minimum cost covering
0 references
minimum cost operating
0 references
uncapacitated plant location
0 references
transformation procedure
0 references
duality
0 references
