Packet Routing in Telecommunication Networks with Path and Flow Restrictions

DOI10.1287/IJOC.11.2.188MaRDI QIDQ4427375zbMATH OpenOpenAlexFDO

Authors Jerome Chifflet, Philippe Mahey, 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

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

Cited in

(12)

• A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem
• Hop-constrained node survivable network design: An application to MPLS over WDM
• New formulations and solution procedures for the hop constrained network design problem.
• 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
• Inexact decomposition methods for solving variational inequalities with linear equality constraint
• Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
• New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin 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
• Approximation algorithms for hop constrained and buy-at-bulk network design via hop constrained oblivious routing
• An extended alternating direction method for variational inequality problems with linear equality and inequality constraints

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427375)