The capacitated minimum spanning tree problem: revisiting hop-indexed formulations (Q1772873): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cor.2004.03.011 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2013912214 / rank | |||
Normal rank | |||
Revision as of 22:48, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The capacitated minimum spanning tree problem: revisiting hop-indexed formulations |
scientific article |
Statements
The capacitated minimum spanning tree problem: revisiting hop-indexed formulations (English)
0 references
21 April 2005
0 references
Capacitated spanning trees
0 references
Hop-indexed formulations
0 references
Generalized subtour elimination constraints
0 references
Cutting plane algorithms
0 references
