Technical Note—Solving Constrained Multi-Facility Location Problems Involving <i>l</i><sub><i>p</i></sub> Distances Using Convex Programming (Q4070998): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/opre.23.3.581 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1980834315 / rank | |||
Normal rank | |||
Latest revision as of 14:30, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Technical Note—Solving Constrained Multi-Facility Location Problems Involving <i>l</i><sub><i>p</i></sub> Distances Using Convex Programming |
scientific article |
Statements
Technical Note—Solving Constrained Multi-Facility Location Problems Involving <i>l</i><sub><i>p</i></sub> Distances Using Convex Programming (English)
0 references
1975
0 references
