On the public citation graph
Optimization of Internet Protocol network design and routing
0 signed · 101 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/1520-6750(199304)40:3<305::aid-nav3220400303>3.0.co;2-4openalex-snapshot
Dual-ascent methods for large-scale multicommodity flow problems
inferredcites →https://doi.org/10.1002/nav.3800240210openalex-snapshot
Solving multicommodity transportation problems using a primal partitioning simplex technique
inferredcites →https://doi.org/10.1002/net.3230030202openalex-snapshot
The flow deviation method: An approach to store‐and‐forward communication network design
inferredcites →https://doi.org/10.1002/net.3230190305openalex-snapshot
Networks synthesis and optimum network design problems: Models, solution methods and applications
inferredcites →https://doi.org/10.1007/978-3-642-46787-5openalex-snapshot
Applied Simulated Annealing
inferredcites →https://doi.org/10.1007/bf01585162openalex-snapshot
Multicommodity network flows: The impact of formulation on decomposition
inferredcites →https://doi.org/10.1007/bf02094337openalex-snapshot
Topological design of wide area communication networks
inferredcites →https://doi.org/10.1007/bf02110307openalex-snapshot
A column generation and partitioning approach for multi-commodity flow problems
inferredcites →https://doi.org/10.1007/bf02136157openalex-snapshot
Telecommunications network topological design and capacity expansion: Formulations and algorithms
inferredcites →https://doi.org/10.1007/bf02592077openalex-snapshot
LP extreme points and cuts for the fixed-charge network design problem
inferredcites →https://doi.org/10.1007/bfb0121090openalex-snapshot
Tailoring Benders decomposition for uncapacitated network design
inferredcites →https://doi.org/10.1016/0167-6377(92)90100-hopenalex-snapshot
A characterization of the uncapacitated network design polytope
inferredcites →https://doi.org/10.1016/0377-2217(90)90001-ropenalex-snapshot
Simulated annealing: A tool for operational research
inferredcites →https://doi.org/10.1080/01966324.1988.10737242openalex-snapshot
Simulated Annealing – An Annotated Bibliography
inferredcites →https://doi.org/10.1109/26.81738openalex-snapshot
MENTOR: an algorithm for mesh network topological optimization and routing
inferredcites →https://doi.org/10.1109/49.725189openalex-snapshot
Optimal design and evaluation of survivable WDM transport networks
inferredcites →https://doi.org/10.1109/infcom.2000.832225openalex-snapshot
Internet traffic engineering by optimizing OSPF weights
inferredcites →https://doi.org/10.1109/t-c.1974.223806openalex-snapshot
Optimal Routing in a Packet-Switched Computer Network
inferredcites →https://doi.org/10.1109/tcom.1977.1093711openalex-snapshot
A Minimum Delay Routing Algorithm Using Distributed Computation
inferredcites →https://doi.org/10.1287/ijoc.11.4.370openalex-snapshot
A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
inferredcites →https://doi.org/10.1287/ijoc.8.3.243openalex-snapshot
Capacitated Network Design—Polyhedral Structure and Computation
inferredcites →https://doi.org/10.1287/ijoc.9.2.154openalex-snapshot
Solving Multicommodity Flow Problems with a Primal Embedded Network Simplex Algorithm
inferredcites →https://doi.org/10.1287/mnsc.46.5.693.12042openalex-snapshot
A Decomposition-Based Pricing Procedure for Large-Scale Linear Programs: An Application to the Linear Multicommodity Flow Problem
inferredcites →https://doi.org/10.1287/opre.37.5.716openalex-snapshot
A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
inferredcites →https://doi.org/10.1287/opre.43.1.142openalex-snapshot
Modeling and Solving the Two-Facility Capacitated Network Loading Problem
inferredcites →https://doi.org/10.1287/opre.43.1.43openalex-snapshot
Lower Bounding Procedures for Multiperiod Telecommunications Network Expansion Problems
inferredcites →https://doi.org/10.1287/opre.46.2.247openalex-snapshot
Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound
inferredcites →https://doi.org/10.1287/opre.48.2.318.12378openalex-snapshot
Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems
inferredcites →https://doi.org/10.1287/opre.48.3.461.12439openalex-snapshot
A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
inferredcites →https://doi.org/10.1287/trsc.18.1.1openalex-snapshot
Network Design and Transportation Planning: Models and Algorithms
inferredcites →https://doi.org/10.17487/rfc1142openalex-snapshot
OSI IS-IS Intra-domain Routing Protocol
inferredcites →https://doi.org/10.17487/rfc1195openalex-snapshot
Use of OSI IS-IS for routing in TCP/IP and dual environments
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.20018openalex-snapshot
On the impact of the solution representation for the Internet Protocol Network Design Problem with max‐hop constraints
inferred← citeshttps://doi.org/10.1002/net.20141openalex-snapshot
Survivable IP network design with OSPF routing
inferred← citeshttps://doi.org/10.1002/net.20142openalex-snapshot
Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints
inferred← citeshttps://doi.org/10.1002/net.20163openalex-snapshot
Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
inferred← citeshttps://doi.org/10.1002/net.20232openalex-snapshot
Valid cycles: A source of infeasibility in open shortest path first routing
inferred← citeshttps://doi.org/10.1002/net.20255openalex-snapshot
On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem
inferred← citeshttps://doi.org/10.1002/net.20303openalex-snapshot
Approximability of unsplittable shortest path routing problems
inferred← citeshttps://doi.org/10.1002/net.21612openalex-snapshot
On the complexity of equal shortest path routing
inferred← citeshttps://doi.org/10.1007/978-0-387-30165-5_3openalex-snapshot
Integer Programming for Telecommunications
inferred← citeshttps://doi.org/10.1007/978-3-319-17509-6_12openalex-snapshot
A Relax and Fix Approach to Solve the Fixed Charge Network Design Problem with User-Optimal Flow
inferred← citeshttps://doi.org/10.1007/978-3-540-77903-2_2openalex-snapshot
Routing and Capacity Optimization for IP Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-79409-7_7openalex-snapshot
Integer Programming Approaches to Access and Backbone IP Network Planning
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_17openalex-snapshot
An Integer Programming Algorithm for Routing Optimization in IP Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-02250-0_8openalex-snapshot
Optimization of OSPF Routing in IP Networks
inferred← citeshttps://doi.org/10.1007/978-981-19-5845-8_7openalex-snapshot
Optimal Cluster Head Selection Using Vortex Search Algorithm with Deep Learning-Based Multipath Routing in MANET
inferred← citeshttps://doi.org/10.1007/s00453-009-9381-5openalex-snapshot
An Integer Programming Algorithm for Routing Optimization in IP Networks
inferred← citeshttps://doi.org/10.1007/s10288-009-0113-0openalex-snapshot
Intra-domain traffic engineering with shortest path routing protocols
inferred← citeshttps://doi.org/10.1007/s10479-006-0067-yopenalex-snapshot
Multiobjective design of survivable IP networks
inferred← citeshttps://doi.org/10.1007/s10479-012-1270-7openalex-snapshot
Intra-domain traffic engineering with shortest path routing protocols
inferred← citeshttps://doi.org/10.1007/s10852-006-9047-0openalex-snapshot
Optimization Models for Forest Road Upgrade Planning
inferred← citeshttps://doi.org/10.1007/s11081-009-9098-yopenalex-snapshot
OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
inferred← citeshttps://doi.org/10.1007/s11235-009-9162-0openalex-snapshot
Design of OSPF networks using subpath consistent routing patterns
inferred← citeshttps://doi.org/10.1007/s12597-023-00718-0openalex-snapshot
An enhanced Benders decomposition method for unique shortest path routing
inferred← citeshttps://doi.org/10.1016/j.cie.2023.109110openalex-snapshot
Problem characterization of unique shortest path routing
inferred← citeshttps://doi.org/10.1016/j.cor.2016.06.016openalex-snapshot
A variable fixing heuristic with Local Branching for the fixed charge uncapacitated network design problem with user-optimal flow
inferred← citeshttps://doi.org/10.1016/j.future.2011.05.003openalex-snapshot
Link weight assignment and loop-free routing table update for link state routing protocols in energy-aware internet
inferred← citeshttps://doi.org/10.1016/j.neucom.2025.132263openalex-snapshot
Deep reinforcement learning for network routing optimization: A systematic survey
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2601944openalex-snapshot
Internet protocol network design with uncertain demand
inferred← citeshttps://doi.org/10.1057/s41274-016-0144-9openalex-snapshot
An origin-based model for unique shortest path routing
inferred← citeshttps://doi.org/10.1109/adcom.2007.123openalex-snapshot
A Neural Network Approach to Dynamic Frequency Scaling
inferred← citeshttps://doi.org/10.1109/adcom.2007.46openalex-snapshot
Traffic Flow Optimization in Networks with Combined OSPF/MPLS Routing
inferred← citeshttps://doi.org/10.1109/drcn.2007.4762270openalex-snapshot
Optimization of resilient weight systems for shortest-path routing in IP networks
inferred← citeshttps://doi.org/10.1109/drcn.2009.5340014openalex-snapshot
Survivable IP link topology design in an IP-over-WDM architecture
inferred← citeshttps://doi.org/10.1109/icc.2007.105openalex-snapshot
Optimal Link Weights for Maximizing QoS Traffic
inferred← citeshttps://doi.org/10.1109/icisp.2006.33openalex-snapshot
The Interaction of IGP Weight Optimization with BGP
inferred← citeshttps://doi.org/10.1109/icnp59255.2023.10355645openalex-snapshot
Roracle: Enabling Lookahead Routing for Scalable Traffic Engineering with Supervised Learning
inferred← citeshttps://doi.org/10.1109/ictmicc.2007.4448682openalex-snapshot
A review of routing optimization using OSPF
inferred← citeshttps://doi.org/10.1109/icton.2006.248387openalex-snapshot
Optimization of The Shortest-Path Routing with Equal-Cost Multi-Path Load Balancing
inferred← citeshttps://doi.org/10.1109/infocom53939.2023.10228904openalex-snapshot
LARRI: Learning-based Adaptive Range Routing for Highly Dynamic Traffic in WANs
inferred← citeshttps://doi.org/10.1109/ipom.2002.1045774openalex-snapshot
A hybrid genetic algorithm for routing optimization in IP networks utilizing bandwidth and delay metrics
inferred← citeshttps://doi.org/10.1109/ipom.2003.1251229openalex-snapshot
A bicriteria optimization approach for robust OSPF routing
inferred← citeshttps://doi.org/10.1109/iscc.2006.49openalex-snapshot
Choosing Weights for IP Network Dimensioning Optimization
inferred← citeshttps://doi.org/10.1109/iscc.2011.5983867openalex-snapshot
Multi-Topology design and link weight assignment for green IP networks
inferred← citeshttps://doi.org/10.1109/iwqos57198.2023.10188762openalex-snapshot
Reinforcement Learning-based Traffic Engineering for QoS Provisioning and Load Balancing
inferred← citeshttps://doi.org/10.1109/jsac.2020.3000371openalex-snapshot
CFR-RL: Traffic Engineering With Reinforcement Learning in SDN
inferred← citeshttps://doi.org/10.1109/jsac.2022.3191337openalex-snapshot
Mitigating Routing Update Overhead for Traffic Engineering by Combining Destination-Based Routing With Reinforcement Learning
inferred← citeshttps://doi.org/10.1109/jsac.2025.3528815openalex-snapshot
Path-Based Graph Neural Network for Robust and Resilient Routing in Distributed Traffic Engineering
inferred← citeshttps://doi.org/10.1109/netwks.2008.6231351openalex-snapshot
Flow optimization in IP networks with fast proactive recovery
inferred← citeshttps://doi.org/10.1109/netwks.2014.6959265openalex-snapshot
Mathematical modelling of metric-driven routing and resource allocation in wireless mesh networks
inferred← citeshttps://doi.org/10.1109/ngi.2005.1431664openalex-snapshot
Combined link dimensioning and weight assignment of minimum weight routing networks
inferred← citeshttps://doi.org/10.1109/ngi.2008.15openalex-snapshot
Three Methods for Optimizing Single-Shortest Path Routing
inferred← citeshttps://doi.org/10.1109/tmc.2025.3628341openalex-snapshot
An End-to-End Learning Approach for Traffic Engineering With Sparse Traffic Measurements
inferred← citeshttps://doi.org/10.1109/tnet.2007.902546openalex-snapshot
Routing Optimization in IP Networks Utilizing Additive and Concave Link Metrics
inferred← citeshttps://doi.org/10.1109/tnet.2008.2006219openalex-snapshot
Optimal Link Weights for IP-Based Networks Supporting Hose-Model VPNs
inferred← citeshttps://doi.org/10.1109/tnet.2014.2348176openalex-snapshot
Load Balancing in IP Networks Using Generalized Destination-Based Multipath Routing
inferred← citeshttps://doi.org/10.1109/tnet.2022.3217083openalex-snapshot
FlexDATE: Flexible and Disturbance-Aware Traffic Engineering With Reinforcement Learning in Software-Defined Networks
inferred← citeshttps://doi.org/10.1109/tnnls.2021.3070584openalex-snapshot
Multiagent Meta-Reinforcement Learning for Adaptive Multipath Routing Optimization
inferred← citeshttps://doi.org/10.1109/tnsm.2020.3045145openalex-snapshot
Preventive Start-Time Optimization to Determine Link Weights Against Probabilistic Link Failures
inferred← citeshttps://doi.org/10.1109/tnsm.2026.3716021openalex-snapshot
A Robust Traffic Engineering Method With Siamese GCN-Based Link Failure Awareness
inferred← citeshttps://doi.org/10.1109/ton.2025.3607939openalex-snapshot
Learning-Based Adaptive Range Routing for Traffic Engineering With Graph Neural Networks
inferred← citeshttps://doi.org/10.1111/j.1475-3995.2010.00771.xopenalex-snapshot
A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
inferred← citeshttps://doi.org/10.1145/1141277.1141368openalex-snapshot
Enforcing path uniqueness in internet routing
inferred← citeshttps://doi.org/10.23919/ifipnetworking52078.2021.9472833openalex-snapshot
Network Slicing with Multi-Topology Routing
inferred← citeshttps://doi.org/10.4018/jitn.2013010103openalex-snapshot
Designing an IP Link Topology for a Metro Area Backbone Network
inferred← citeshttps://doi.org/10.48550/arxiv.0807.0038openalex-snapshot
A Novel Mathematical Model for the Unique Shortest Path Routing Problem
inferred← citeshttps://doi.org/10.70675/11cb650fzd30bz4f42z94ffz0e8c0874b9cfopenalex-snapshot
Contributions à la conception de réseaux avec coûts fixes et routes optimales pour les usagers
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.