Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem (Q5690262): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (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.1287/ijoc.8.3.219 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2064806410 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:23, 20 March 2024
scientific article; zbMATH DE number 967141
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem |
scientific article; zbMATH DE number 967141 |
Statements
Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem (English)
0 references
9 October 1997
0 references
telecommunications network design
0 references
capacitated centralized processing network
0 references
cutting plane algorithm
0 references
capacitated spanning tree problem
0 references
general-demand case
0 references
branch-and-cut
0 references
vehicle routing
0 references
