A comparison of node-based and arc-based hop-indexed formulations for the Steiner tree problem with hop constraints.
Bernard FortzLuis Eduardo Neves GouveiaPedro MouraPublished in: Networks (2022)
Keyphrases
- destination node
- miller tucker zemlin
- constraint programming
- constrained optimization
- constraint satisfaction
- linear constraints
- routing table
- information retrieval systems
- tree structure
- co occurrence
- directed graph
- neural network
- optimization methods
- evolutionary algorithm
- multicast routing
- lower bound
- frequency hopping
- integer programming formulations
- social networks