A branch and bound algorithm for the capacitated minimum spanning tree problem (Q3141109): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230230603 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2124540286 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem / rank | |||
Normal rank | |||
Revision as of 10:34, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm for the capacitated minimum spanning tree problem |
scientific article |
Statements
A branch and bound algorithm for the capacitated minimum spanning tree problem (English)
0 references
16 August 1994
0 references
undirected graph
0 references
center
0 references
capacitated minimum spanning tree
0 references
network design
0 references
vehicle routing
0 references
branch and bound
0 references
Lagrangean relaxation
0 references
