A branch-and-cut algorithm for the partitioning-hub location-routing problem (Q709201): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Network hub location problems: The state of the art / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Facets of the clique partitioning polytope / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The partition problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The equipartition polytope. II: Valid inequalities and facets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Location-area partition in a cellular radio network / rank | |||
Normal rank | |||
Latest revision as of 08:57, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut algorithm for the partitioning-hub location-routing problem |
scientific article |
Statements
A branch-and-cut algorithm for the partitioning-hub location-routing problem (English)
0 references
15 October 2010
0 references
size constrained clique partitioning
0 references
graph partitioning
0 references
communication networks
0 references
hub-location
0 references
branch-and-cut
0 references
