On solving bi-objective constrained minimum spanning tree problems (Q6166107): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10898-023-01295-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4378227366 / rank | |||
Normal rank | |||
Revision as of 11:04, 30 July 2024
scientific article; zbMATH DE number 7721400
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On solving bi-objective constrained minimum spanning tree problems |
scientific article; zbMATH DE number 7721400 |
Statements
On solving bi-objective constrained minimum spanning tree problems (English)
0 references
2 August 2023
0 references
multiple objective programming
0 references
hop-constrained minimum spanning tree
0 references
delay-constrained minimum spanning tree
0 references
augmented \(\epsilon\)-constraint
0 references
bottleneck objective function
0 references
MTZ constraints
0 references
