Packet Routing in Telecommunication Networks with Path and Flow Restrictions

DOI10.1287/ijoc.11.2.188zbMath1040.90508OpenAlexW2133150235MaRDI QIDQ4427375

Philippe Mahey, Jerome Chifflet, Larry J. Le Blanc

Publication date: 1999

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.11.2.188

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18)

Related Items (11)

Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem ⋮ An extended alternating direction method for variational inequality problems with linear equality and inequality constraints ⋮ New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints ⋮ A new self-adaptive alternating direction method for variational inequality problems with linear equality and inequality constraints ⋮ Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints ⋮ A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem ⋮ New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints ⋮ Inexact decomposition methods for solving variational inequalities with linear equality constraint ⋮ A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem ⋮ New formulations and solution procedures for the hop constrained network design problem. ⋮ Hop-constrained node survivable network design: An application to MPLS over WDM

This page was built for publication: Packet Routing in Telecommunication Networks with Path and Flow Restrictions