- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1476-9360
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
A greedy heuristic for the capacitated minimum spanning tree problem ; day:21 ; month:12 ; year:2016 ; pages:1-13
Journal of the Operational Research Society / Operational Research Society ; (21.12.2016), 1-13
- Classification
-
Management
- Creator
-
Kritikos, M.
- Contributor
-
Ioannou, G.
SpringerLink (Online service)
- DOI
-
10.1057/s41274-016-0146-7
- URN
-
urn:nbn:de:1111-201701318211
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
- 14.08.2025, 10:49 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Kritikos, M.
- Ioannou, G.
- SpringerLink (Online service)
Other Objects (12)
Weight-Constrained Minimum Spanning Tree Problem
Diameter Constrained Fuzzy Minimum Spanning Tree Problem
Engineering an external memory minimum spanning tree algorithm
The prize-collecting generalized minimum spanning tree problem
Minimum Spanning Trees Made Easier Via Multi-Objective Optimization
Ant colony optimization and the minimum spanning tree problem
A Stronger Lower Bound on Parametric Minimum Spanning Trees
Subsidies, knapsack auctions and Dantzig's greedy heuristic
Subsidies, Knapsack Auctions and Dantzig's Greedy Heuristic
Subsidies, knapsack auctions and Dantzig's greedy heuristic
Reconstructing B cell lineage trees with minimum spanning tree and genotype abundances
Algorithms for the minimum spanning tree problem with resource allocation
Weight-Constrained Minimum Spanning Tree Problem
Diameter Constrained Fuzzy Minimum Spanning Tree Problem
Engineering an external memory minimum spanning tree algorithm
The prize-collecting generalized minimum spanning tree problem
Minimum Spanning Trees Made Easier Via Multi-Objective Optimization
Ant colony optimization and the minimum spanning tree problem
A Stronger Lower Bound on Parametric Minimum Spanning Trees
Subsidies, knapsack auctions and Dantzig's greedy heuristic
Subsidies, Knapsack Auctions and Dantzig's Greedy Heuristic
Subsidies, knapsack auctions and Dantzig's greedy heuristic
Reconstructing B cell lineage trees with minimum spanning tree and genotype abundances
Algorithms for the minimum spanning tree problem with resource allocation
Weight-Constrained Minimum Spanning Tree Problem
Diameter Constrained Fuzzy Minimum Spanning Tree Problem
Engineering an external memory minimum spanning tree algorithm
The prize-collecting generalized minimum spanning tree problem
Minimum Spanning Trees Made Easier Via Multi-Objective Optimization
Ant colony optimization and the minimum spanning tree problem
A Stronger Lower Bound on Parametric Minimum Spanning Trees
Subsidies, knapsack auctions and Dantzig's greedy heuristic
Subsidies, Knapsack Auctions and Dantzig's Greedy Heuristic
Subsidies, knapsack auctions and Dantzig's greedy heuristic
Reconstructing B cell lineage trees with minimum spanning tree and genotype abundances