Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
type: Item
instance of: scholarly article
title: Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
zbMATH Open document ID: 0854.90139
DOI: 10.1016/0305-0548(94)00074-I
published in: Computers \& Operations Research
publication date: 1997-01-19T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 910354
zbMATH Keywords: Hop constrained minimal spanning tree
zbMATH Keywords: subtour elimination
zbMATH Keywords: liftings
zbMATH Keywords: Lagrangean relaxation
zbMATH Keywords: subgradient optimization
author: Luis Gouveia
MaRDI profile type: Publication
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: Topological design of centralized computer networks—formulations and algorithms
cites work: Edge exchanges in the degree-constrained minimum spanning tree problem
cites work: A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
cites work: Q3993417
cites work: An Algorithmic Approach to Network Location Problems. II: Thep-Medians
cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
cites work: Integer programming formulations for the multi-depot vehicle routing problem: Comments on a paper by Kulkarni and Bhave
cites work: Optimum branchings
cites work: Q4178782
cites work: Validation of subgradient optimization
cites work: Multicommodity flow models for spanning trees with hop constraints
description: scientific article; zbMATH DE number 910354