A branch and bound algorithm for the capacitated minimum spanning tree problem (Q3141109): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/net.3230230603 / rank | |||
| 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 | |||
| Property / DOI | |||
| Property / DOI: 10.1002/NET.3230230603 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 18:25, 20 December 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
