Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation (Q2465657): 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.1007/s10107-006-0043-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1990399046 / rank | |||
Normal rank | |||
Revision as of 20:53, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation |
scientific article |
Statements
Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation (English)
0 references
7 January 2008
0 references
q-arbs
0 references
pricing subproblem
0 references
