An exact algorithm for min-max hyperstructure equipartition with a connected constraint (Q1652415)
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: An exact algorithm for min-max hyperstructure equipartition with a connected constraint |
scientific article; zbMATH DE number 6901484
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact algorithm for min-max hyperstructure equipartition with a connected constraint |
scientific article; zbMATH DE number 6901484 |
Statements
An exact algorithm for min-max hyperstructure equipartition with a connected constraint (English)
0 references
11 July 2018
0 references
hyperstructure equipartition
0 references
NP-hard
0 references
minimax programming
0 references
connected constraint
0 references
balanced constraint
0 references
rapid transit network
0 references
0 references
0 references
0 references
0.7466620802879333
0 references
0.7410857677459717
0 references
0.741051971912384
0 references