Packet Routing in Telecommunication Networks with Path and Flow Restrictions-Reference-Cited by-同舟云学术

Packet Routing in Telecommunication Networks with Path and Flow Restrictions

Published:1999-05 Issue:2 Volume:11 Page:188-197
ISSN:1091-9856
Container-title:INFORMS Journal on Computing
language:en
Short-container-title:INFORMS Journal on Computing

Author:

LeBlanc Larry J.,Chifflet Jerome,Mahey Philippe

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

General Engineering

Link

https://pubsonline.informs.org/doi/pdf/10.1287/ijoc.11.2.188

Reference25 articles.

1. Altinkemer K. , Gavish B. Augmented Lagrangean method for routing in frame and cell relay networks with time restrictions.Proc. 4th Internat. Conf. Telecomm. Systems: Model. Anal.(1996) Nashville, TN 285 294

2. Using a Hop-Constrained Model to Generate Alternative Communication Network Design

3. Bazaraa M. , Shetty C.Nonlinear Programming: Theory and Algorithms(1979) (Wiley, NY) 331 342

4. Multi-hour design of computer backbone networks

Cited by 26 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Toward Secure Graph Data Collaboration in a Data-Sharing-Free Manner: A Novel Privacy-Preserving Graph Pre-training Model;SSRN Electronic Journal;2023

2. Hop-Constrained Metric Embeddings and their Applications;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02

3. Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem;Computers & Operations Research;2016-01

4. Connection-Oriented Networks;Modeling and Optimization of Cloud-Ready and Content-Oriented Networks;2016

5. Case studies;Optimization by GRASP;2016