Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation (Q2465657): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: VRP / rank | |||
Normal rank | |||
Revision as of 04:57, 28 February 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
