A multicommodity network flow application for the capacitated minimal spanning tree problem
type: Item
instance of: scholarly article
title: A multicommodity network flow application for the capacitated minimal spanning tree problem
zbMATH Open document ID: 0829.90055
author: Rakesh Kawatra
published in: Opsearch
publication date: 1995-05-18T00:00:00Z
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 756703
zbMATH Keywords: capacitated minimal spanning tree problem
zbMATH Keywords: multicommodity network flow
zbMATH Keywords: Lagrangean relaxation
zbMATH Keywords: subgradient optimization
MaRDI profile type: Publication
Recommended article: The multilevel capacitated minimum spanning tree problem
Recommended article: The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving
Recommended article: Multicommodity flow models for spanning trees with hop constraints
Recommended article: Min-cost multiflows in node-capacitated undirected networks
Recommended article: The capacitated minimum spanning tree problem: On improved multistar constraints
Recommended article: Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
Recommended article: Automata, Languages and Programming
Recommended article: The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
Recommended article: Q3840370
Recommended article: Q5426803
description: scientific article; zbMATH DE number 756703