Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes.
Michael M. SørensenPublished in: Discret. Optim. (2017)
Keyphrases
- root node
- node selection
- destination node
- shortest path
- source node
- path length
- directed graph
- sink node
- search tree
- wireless sensor networks
- intermediate nodes
- optimal path
- graph structure
- shortest distance
- labeling scheme
- neighboring nodes
- finding the shortest path
- link failure
- leaf nodes
- routing protocol
- single source
- multicast tree
- np hard
- lot sizing
- spanning tree
- betweenness centrality
- edge weights
- multi item
- routing problem
- tree nodes
- nodes of a graph
- energy consumption
- network nodes
- hidden nodes
- node failures
- strongly connected
- facility location
- centrality measures
- disjoint paths
- small world
- sensor nodes
- convex hull
- routing algorithm
- undirected graph
- vehicle routing problem
- integer programming
- shortest path problem
- multi source
- lattice points
- sensor networks
- rooted trees
- wireless mesh networks
- social networks
- mobile nodes