Technical Note—Solving Constrained Multi-Facility Location Problems Involving <i>l</i><sub><i>p</i></sub> Distances Using Convex Programming (Q4070998)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Technical Note—Solving Constrained Multi-Facility Location Problems Involving lp Distances Using Convex Programming |
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
