An integer linear programming approach to the steiner problem in graphs (Q3890443): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (6 intermediate revisions by 5 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/net.3230100207 / rank | |||
| Property / author | |||
| Property / author: Yash P. Aneja / rank | |||
| Property / author | |||
| Property / author: Yash P. Aneja / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230100207 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2007503572 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/NET.3230100207 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:37, 22 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An integer linear programming approach to the steiner problem in graphs |
scientific article |
Statements
An integer linear programming approach to the steiner problem in graphs (English)
0 references
1980
0 references
integer linear programming
0 references
Steiner problem in graphs
0 references
connected undirected graph
0 references
minimal weighted tree
0 references
set covering formulation
0 references
row generation scheme
0 references
