Multicommodity flow models for spanning trees with hop constraints
type: Item
instance of: scholarly article
title: Multicommodity flow models for spanning trees with hop constraints
zbMATH Open document ID: 0947.90513
DOI: 10.1016/0377-2217(95)00090-9
published in: European Journal of Operational Research
publication date: 1999-04-22T00:00:00Z
Mathematics Subject Classification ID: 90B25
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 1252937
zbMATH Keywords: integer programming
zbMATH Keywords: linear programming relaxations
zbMATH Keywords: multicommodity flows
zbMATH Keywords: trees
zbMATH Keywords: hop constraints
zbMATH Keywords: reliability
author: Luis Gouveia
MaRDI profile type: Publication
full work available at URL: 0377-2217(95)00090-9
OpenAlex ID: W2019067222
cites work: Using a Hop-Constrained Model to Generate Alternative Communication Network Design
cites work: A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
cites work: Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem
cites work: Optimum branchings
cites work: An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
cites work: Q4178782
cites work: A catalog of steiner tree formulations
cites work: Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
cites work: Validation of subgradient optimization
cites work: Q3197844
description: scientific article; zbMATH DE number 1252937