Data mapping of linear programming on fixed-size hypercubes (Q751769)
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: Data mapping of linear programming on fixed-size hypercubes |
scientific article; zbMATH DE number 4178650
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Data mapping of linear programming on fixed-size hypercubes |
scientific article; zbMATH DE number 4178650 |
Statements
Data mapping of linear programming on fixed-size hypercubes (English)
0 references
1990
0 references
The authors consider the solution of the linear programming problem via the simplex method on a hypercube computer from a theoretical perspective. Load balancing questions and communication complexity are considered. There are no numerical experiments.
0 references
linear programming
0 references
simplex method
0 references
hypercube computer
0 references
Load balancing
0 references
communication complexity
0 references
0.84789324
0 references
0.8441964
0 references
0.84142756
0 references
0.83539414
0 references
0.83524543
0 references
