Lagrangean bounds for the optimum communication spanning tree problem

DOI10.1007/s11750-009-0112-5zbMath1201.90044OpenAlexW2033487388MaRDI QIDQ611003

Elena Fernández, Alfredo Marín, Iván A. Contreras

Publication date: 13 December 2010

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-009-0112-5

zbMATH Keywords

heuristicsLagrangean relaxationnetwork design

Mathematics Subject Classification ID

Integer programming (90C10) Communication networks in operations research (90B18) Deterministic network models in operations research (90B10)

Related Items (8)

Looking for edge-equitable spanning trees ⋮ Combined column-and-row-generation for the optimal communication spanning tree problem ⋮ General network design: a unified view of combined location and network design problems ⋮ The discrete facility location problem with balanced allocation of customers ⋮ New Valid Inequalities for the Optimal Communication Spanning Tree Problem ⋮ Solving the optimum communication spanning tree problem ⋮ Range minimization problems in path-facility location on trees ⋮ The minimum flow cost Hamiltonian cycle problem: a comparison of formulations

Cites Work

• Unnamed Item
• Unnamed Item
• Tight bounds from a path based formulation for the tree of hub location problem
• The tree of hubs location problem
• Optimization, approximation, and complexity classes
• Approximation algorithms for some optimum communication spanning tree problems
• Representations for genetic and evolutionary algorithms. With a foreword by David E. Goldberg.
• Lagrangean relaxation. (With comments and rejoinder).
• Algorithms for the optimum communication spanning tree problem
• Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem
• The complexity of the network design problem
• A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees
• Exact algorithms for minimum routing cost trees
• A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
• A polynomial time approximation scheme for the two-source minimum routing cost spanning trees
• A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
• On Optimal Solutions for the Optimal Communication Spanning Tree Problem

This page was built for publication: Lagrangean bounds for the optimum communication spanning tree problem