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
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:06, 6 February 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
